Unbounded Dependencies and Subjacency in a Tree Adjoining Grammar

Kapitel in diesem Buch

1. Prelim pages i
2. Table of contents v
3. Names and Addresses of Contributors vii
4. Introduction ix
5. Computational Complexity, Mathematical Linguistics, and Linguistic Theory 1
6. Exceptions to Generic Generalizations 19
7. The Structure Underlying a Semantic Domain 33
8. Binary Rules and Non-Binary Trees 65
9. An Introduction to Tree Adjoining Grammar 87
10. The Notion ‘Rule of Grammar’ Reconsidered 115
11. Unbounded Dependencies and Subjacency in a Tree Adjoining Grammar 143
12. A Topological Approach to Structural Equivalence of Formal Languages 173
13. On the Design of Finite Transducers for Parsing Phrase-Structure Languages 191
14. Graphs and Grammars 237
15. Discontinuity and Phrase Structure Grammar 257
16. Sources of Intractability in GPSG Theory 277
17. Formal Properties of Head Grammars 293
18. Finding Natural Languages a Home in Formal Language Theory 349
19. Theories of Language Learnability 361
20. Remarks on Linguistic Semantics 373
21. On the Progression from Context-Free to Tree Adjoining Languages 389