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.
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.
Dewey Decimal Classfication (DDC)