Tree Adjoining Grammars
Mathematical, Computational and Linguistic Properties
Published on 1. June 2000
Book
Paperback/Softback
400 pages
978-1-57586-252-1 (ISBN)
Description
Researchers in theoretical linguistics, psycholinguistics, cognitive science, and in natural language processing have recently converged on a collective insight: formalizing the syntax of words is central to describing, understanding, and analyzing language. This insight has sparked considerable interest in Tree Adjoining Grammar, a lexically-oriented mathematical formalism that can precisely capture the syntactic properties of natural languages such as English or Korean. This volume combines contributions from a variety of authors who discuss the formalism itself, its use in analyzing linguistic phenomena, and its use in building natural language processing systems.
More details
Series
Language
English
Place of publication
Stanford
United States
Target group
Professional and scholarly
Product notice
Paperback (trade)
Dimensions
Height: 228 mm
Width: 152 mm
Thickness: 28 mm
Weight
649 gr
ISBN-13
978-1-57586-252-1 (9781575862521)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
1. Complexity of scrambling; 2. Natural language processing with Schema-TAGS; 3. Non-isomorphic synchronous TAGs; 4. Semantics of pragmatic connectives in TAG; 5; Implications of codeswitching for lexicalized TAG; 6. Adnominal adjectives, code-switching and lexicalized TAG; 7. E-TAG, a lexicalized formalism for text generation; 8. Evolution of the XTAG system; 9. A bottom-up TAG parser; 10. Developing a wide-coverage CCG System.