To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper describes the Linguistic Annotation Framework under development within ISO TC37 SC4 WG1. The Linguistic Annotation Framework is intended to serve as a basis for harmonizing existing language resources as well as developing new ones.
In this paper we present recent work on GATE, a widely-used framework and graphical development environment for creating and deploying Language Engineering components and resources in a robust fashion. The GATE architecture has facilitated the development of a number of successful applications for various language processing tasks (such as Information Extraction, dialogue and summarisation), the building and annotation of corpora and the quantitative evaluations of LE applications. The focus of this paper is on recent developments in response to new challenges in Language Engineering: Semantic Web, integration with Information Retrieval and data mining, and the need for machine learning support.
My goal in this text is to develop Galois theory in as accessible a manner as possible for an undergraduate audience.
Consequently, algebraic numbers and their minimal polynomials, objects as concrete as any in field theory, are the central concepts throughout most of the presentation. Moreover, the choices of theorems, their proofs, and (where possible) their order were determined by asking natural questions about algebraic numbers and the field extensions they generate, rather than by asking how Galois theory might be presented with utmost efficiency. Some results are deliberately proved in a less general context than is possible so that readers have ample opportunities to engage the material with exercises. In order that the development of the theory does not rely too much on the mathematical expertise of the reader, hints or proof sketches are provided for a variety of problems.
The text assumes that readers will have followed a first course in abstract algebra, having learned basic results about groups and rings from one of several standard undergraduate texts. Readers do not, however, need to know many results about fields. After some preliminaries in the first chapter, giving readers a common foundation for approaching the subject, the exposition moves slowly and directly toward the Galois theory of finite extensions of the rational numbers. The focus on the early chapters, in particular, is on building intuition about algebraic numbers and algebraic field extensions.
All of us build intuition by experimenting with concrete examples, and the text incorporates, in both examples and exercises, technological tools enabling a sustained exploration of algebraic numbers.
Every building, and every computer program, has an architecture: structural and organisational principles that underpin its design and construction. The garden shed once built by one of the authors had an ad hoc architecture, extracted (somewhat painfully) from the imagination during a slow and non-deterministic process that, luckily, resulted in a structure which keeps the rain on the outside and the mower on the inside (at least for the time being). As well as being ad hoc (i.e. not informed by analysis of similar practice or relevant science or engineering) this architecture is implicit: no explicit design was made, and no records or documentation kept of the construction process.
There are eleven conjugacy classes of the 30 subgroups of S4, as follows:
(1) {〈0〉}, the class consisting of the single subgroup of order 1.
(2) The class of all subgroups of order 2 that are generated by a single transposition, that is, subgroups of the form 〈(ij)〉 for distinct i and j. This class has six elements.
(3) The class of all subgroups of order 2 that are generated by the product of two disjoint transpositions, that is, subgroups of the form 〈(ij)(kl)〉 for distinct i, j, k, and l. This class has three elements.
(4) The class of all subgroups of order 3. These are generated by a 3-cycle and take the form 〈(ijk)〉 for distinct i, j, and k. This class has four elements.
(5) The class of all cyclic subgroups of order 4. These are generated by a 4-cycle and take the form 〈(ijkl)〉 for distinct i, j, k, and l. This class has three elements.
(6) The class of all subgroups of order 4 isomorphic to the Klein 4-group ℤ/2ℤ ⊕ ℤ/2ℤ that are generated by two transpositions. These subgroups have the form 〈(ij), (kl)〉 for distinct i, j, k, and l. This class has three elements.
(7) {〈(12)(34), (13)(24)〉}, the class consisting of the unique subgroup of order 4 isomorphic to the Klein 4-group ℤ/2ℤ ⊕ ℤ/2ℤ that is generated by two products of two transpositions.
(8) The class of all subgroups of order 6. These have the form 〈(ijk), (ij)〉 for distinct i, j, and k. This class has four elements.
Knowing the Galois correspondence for subfields of ℂ and some strategies for the determination of Galois groups of field extensions is, of course, just the beginning. It is of interest to determine the Galois groups of families of polynomials, to determine field extensions of a ℚ with a specified Galois group, to find generalizations of the Galois theory of subfields of ℂ to arbitrary fields, and to apply the tools of Galois theory to solve problems further a field. In this chapter, we give introductions to several of these topics.
Roots of Unity and Cyclotomic Extensions
Perhaps the most basic polynomials are those of the form Xn − 1. In this section, we study their roots, called roots of unity, and the field extensions they generate. We first define roots of unity and cyclotomic extensions.
Definition 30.1 (Root of Unity, Primitive Root of Unity). A root of unity ω is a root, in the complex numbers, of a polynomial of the form Xn − 1 for some n ∈ ℕ. We say that ω is a primitive root of unity of order n, or a primitive nth root, if ω is a root of Xn − 1, but not of Xm − 1 for any 1 ≤ m < n.
Note that the definition of a root of unity ω is equivalent to saying that ω is an element of finite order in the multiplicative group ℂ* of ℂ, and it will be useful to view roots of unity in this way. You may wish to recall some results on finite cyclic groups, particularly concerning which elements of a cyclic group are generators of that group.
We present the RAGS (Reference Architecture for Generation Systems) framework, a specification of an abstract Natural Language Generation (NLG) system architecture to support sharing, re-use, comparison and evaluation of NLG technologies. We argue that the evidence from a survey of actual NLG systems calls for a different emphasis in a reference proposal from that seen in similar initiatives in information extraction and multimedia interfaces. We introduce the framework itself, in particular the two-level data model that allows us to support the complex data requirements of NLG systems in a flexible and coherent fashion, and describe our efforts to validate the framework through a range of implementations.
IBM Research has over 200 people working on Unstructured Information Management (UIM) technologies with a strong focus on Natural Language Processing (NLP). These researchers are engaged in activities ranging from natural language dialog, information retrieval, topic-tracking, named-entity detection, document classification and machine translation to bioinformatics and open-domain question answering. An analysis of these activities strongly suggested that improving the organization's ability to quickly discover each other's results and rapidly combine different technologies and approaches would accelerate scientific advance. Furthermore, the ability to reuse and combine results through a common architecture and a robust software framework would accelerate the transfer of research results in NLP into IBM's product platforms. Market analyses indicating a growing need to process unstructured information, specifically multilingual, natural language text, coupled with IBM Research's investment in NLP, led to the development of middleware architecture for processing unstructured information dubbed UIMA. At the heart of UIMA are powerful search capabilities and a data-driven framework for the development, composition and distributed deployment of analysis engines. In this paper we give a general introduction to UIMA focusing on the design points of its analysis engine architecture and we discuss how UIMA is helping to accelerate research and technology transfer.
Over any field K ⊂ ℂ, we have associated to each algebraic number α a polynomial mα,K and a field K(α). In this chapter,we consider to what extent these objects are unique, that is, whether a given polynomial or field might be generated by other algebraic numbers β as well. In the first section, we determine all of the algebraic numbers to which a minimal polynomial is associated. In the second, we find that if a field is generated by an algebraic number, it is generated by each of an infinite number of algebraic numbers, and we introduce a notion of size of a generated field. Finally, in section 14 we introduce tools for exploring fields generated by an algebraic number.
Minimal Polynomials Are Associated to Which Algebraic Numbers?
We seek to describe the relationship between algebraic numbers and minimal polynomials as precisely as possible, and we begin by observing how many roots a polynomial may have in a field. We will then relate these roots to linear factors of the polynomial over the complex numbers, and we finally consider what we may say about minimal – that is, irreducible – polynomials.
A Polynomial of Degree n Has at Most n Roots in Any Field Extension
We first present a theorem over arbitrary fields that bounds the number of roots a polynomial may have in a field.
Theorem 11.1. Let K be a field, p ∈ K[X] a nonzero polynomial, n = deg(p), and L a field containing K. Then p has no more than n roots in L.
The KIM platform provides a novel Knowledge and Information Management framework and services for automatic semantic annotation, indexing, and retrieval of documents. It provides a mature and semantically enabled infrastructure for scalable and customizable information extraction (IE) as well as annotation and document management, based on GATE.General Architecture for Text Engineering (GATE) (http://gate.ac.uk), leading NLP and IE platform developed at the University of Sheffield. Our understanding is that a system for semantic annotation should be based upon a simple model of real-world entity concepts, complemented with quasi-exhaustive instance knowledge. To ensure efficiency, easy sharing, and reusability of the metadata we introduce an upper-level ontology. Based on the ontology, a large-scale instance base of entity descriptions is maintained. The knowledge resources involved are handled by use of state-of-the-art Semantic Web technology and standards, including RDF(S) repositories, ontology middleware and reasoning. From a technical point of view, the platform allows KIM-based applications to use it for automatic semantic annotation, for content retrieval based on semantic queries, and for semantic repository access. As a framework, KIM also allows various IE modules, semantic repositories and information retrieval engines to be plugged into it. This paper presents the KIM platform, with an emphasis on its architecture, interfaces, front-ends, and other technical issues.
Generic software architectures aim to support re-use of components, focusing of research and development effort, and evaluation and comparison of approaches. In the field of natural language processing, generic frameworks for understanding have been successfully deployed to meet all of these aims, but nothing comparable yet exists for generation. The nature of the task itself, and the current methodologies available to research it, seem to make it more difficult to reach the necessary level of consensus to support generic proposals. Recent work has made progress towards establishing a generic framework for generation at the functional level, but left open the issue of actual implementation. In this paper, we discuss the requirements for such an implementation layer for generation systems, drawing on two initial attempts to implement it. We argue that it is possible and useful to distinguish “functional architecture” from “implementation architecture” for generation systems.
We now extend our investigation to fields generated over a field K by more than one algebraic number, or multiply generated fields. We saw a hint of such fields in section 12.3, where we considered a field K(α) generated by an algebraic number α over a field K(β), itself generated over K by an algebraic number β. In this chapter, we consider several questions concerning fields generated over K by more than one algebraic number:
whether such a field may be generated over K by a single algebraic number;
whether such a field is of finite dimension over K; and
how to specify the structure of such fields via an isomorphism to a quotient ring of a polynomial ring, as we did in section 8.3.
We also examine an important class of fields generated by several algebraic numbers: those that are generated by all of the roots of a polynomial. We then study how to determine isomorphisms from one multiply generated field to another, particularly when the fields are splitting fields. At the end of the chapter, we consider the results of this chapter in the general field-theoretic setting of simple, finite, and algebraic extensions.
Fields Generated by Several Algebraic Numbers
Definition 16.1. Let K be a subfield of ℂ, and let α and β be two algebraic numbers. We denote by K(α, β) the identical fields K(α)(β) = K(β)(α), which we call the field generated by α and β over K.
In support of the preceding definition, note that we may view the set S of all arithmetic combinations of α, β, and elements of K in several ways.
We are now ready to introduce one of the most elegant results in algebra, the Galois correspondence. This correspondence gives us a framework for understanding the relationships between the structure of a splitting field over a field K and the structure of its group of automorphisms over K. Once we establish this correspondence, we go on to study in some detail how the group provides some distinguishing characteristics of the various conjugates over K of an element of the splitting field.
Normal Field Extensions and Splitting Fields
The property of splitting fields that encapsulates much of the information necessary for proving steps in the Galois correspondence is that of normality. In this section, we introduce the property and explore its connection with splitting fields.
Definition 23.1 (Normal Field Extension in ℂ). Let K be a subfield of ℂ. An algebraic field extension L/K is normal if every polynomial f ∈ K[X] that is irreducible over K and that has at least one root in L contains n = deg(f) roots in L.
Note that since the roots of an irreducible polynomial in K[X] are distinct (Theorem11.3), this definition is equivalent to
Definition 23.2 (Normal Field Extension). An algebraic field extension L/K is normal if every polynomial p ∈ K[X] that is irreducible over K and that has at least one root in L factors into linear terms over L.
Clearly a splitting field of an irreducible polynomial p ∈ K[X] satisfies the condition for the particular polynomial p, but the interest of the property lies in whether the condition is satisfied for all irreducible polynomials q ∈ K[X]: each such polynomial must have either none of its roots in L or all of its roots in L.