Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This has made complexity results difficult to obtain. This book introduces a way of obtaining such results. It presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines. Thus the difficulty of processing a construction can be reduced to the difficulty of expressing the constraints that specify it.
James Rogers is Assistant Professor, School of Computer Science, University of Central Florida.
1. Language-theoretic complexity in generative grammar; Part I. The Descriptive Complexity of Strongly Content-Free Languages: 2. Introduction to Part I; 3. Trees as elementary structures; 4. L2K,P and SnS; 5. Definability and non-definability in L2K,P; 6. Conclusion of Part I; Part II. The Generative Capacity of GB Theories: 7. Introduction to Part II; 8. The fundamental strucutres of GB theories; 9. GB and non-definablity in L2K, P; 10. Formalizing X-Bar theory; 11. The lexicon, theta theory and case theory; 12. Binding and control; 13. Chains; 14. Reconstruction; 15. Limitations of the interpretation; 16. Conclusion of Part II; A. Index of symbols; B. Index of definitions; Bibliography; Subject index; Name index.