The Formal Complexity of Natural Language / Edition 1by W.J. Savitch
Pub. Date: 10/31/1987
Publisher: Springer Netherlands
Ever since Chomsky laid the framework for a mathematically formal theory of syntax, two classes of formal models have held wide appeal. The finite state model offered simplicity. At the opposite extreme numerous very powerful models, most notable transformational grammar, offered generality. As soon as this mathematical framework was laid, devastating arguments were… See more details below
Ever since Chomsky laid the framework for a mathematically formal theory of syntax, two classes of formal models have held wide appeal. The finite state model offered simplicity. At the opposite extreme numerous very powerful models, most notable transformational grammar, offered generality. As soon as this mathematical framework was laid, devastating arguments were given by Chomsky and others indicating that the finite state model was woefully inadequate for the syntax of natural language. In response, the completely general transformational grammar model was advanced as a suitable vehicle for capturing the description of natural language syntax. While transformational grammar seems likely to be adequate to the task, many researchers have advanced the argument that it is "too adequate. " A now classic result of Peters and Ritchie shows that the model of transformational grammar given in Chomsky's Aspects [IJ is powerful indeed. So powerful as to allow it to describe any recursively enumerable set. In other words it can describe the syntax of any language that is describable by any algorithmic process whatsoever. This situation led many researchers to reasses the claim that natural languages are included in the class of transformational grammar languages. The conclu sion that many reached is that the claim is void of content, since, in their view, it says little more than that natural language syntax is doable algo rithmically and, in the framework of modern linguistics, psychology or neuroscience, that is axiomatic.
Table of ContentsPrologue.- What is Mathematical Linguistics?.- I. Early Nontransformational Grammar.- to Part I.- Formal Linguistics and Formal Logic.- An Elementary Proof of the Peters-Ritchie Theorem.- On Constraining the Class of Transformational Languages.- Generative Grammars without Transformation Rules-A Defense of Phrase Structure.- A Program for Syntax.- II Modern Context-Free-Like Models.- to Part II.- Natural Languages and Context-Free Languages.- Unbounded Dependency and Coordinate Structure.- On Some Formal Properties of MetaRules.- Some Generalizations of Categorial Grammars.- III More than Context-Free and Less than Transformational Grammar.- to Part III.- Cross-serial Dependencies in Dutch.- Evidence Against the Context-Freeness of Natural Language.- English is not a Context-Free Language.- The Complexity of the Vocabulary of Bambara.- Context-Sensitive Grammar and Natural Language Syntax.- How Non-Context Free is Variable Binding?.- Prologue.- Computationally Relevant Properties of Natural Languages and Their Grammars.- Index of Languages.- Name Index.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >