Abstract
A theory of grammar, such as transformational grammar, context-free grammar, categorial grammar, or any of the many descendants of these grammatical formalisms, serves at least two functions. The formal model should be rich enough to allow descriptions for the full range of data observed for natural language syntax (or at least a good approximation to the full range). Additionally, the formalism should embody a description of the nature, and hence limits, of natural language syntax. The importance of the first function is obvious: if a theory is inconsistent with the data it cannot be correct. The importance of the second function, or even what it is, may not be as clear. Certainly, any theory must explain and must ultimately aid understanding, but the meaning of these terms can be illusive when applied to a formal model for natural language. This is especially true when the topic is weak generative capacity since that context strips languages of all but their surface strings leaving them no structure other than that of a mathematical set. In this context, the facts to be explained are why natural languages produce the strings sets that they do, and not some larger, or smaller, or incomparable collection of string sets. The most obvious way that a theory can explain the phenomena of these natural language string sets is to (weakly) generate exactly these sets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bach, E. and W. Marsh 1978, “An Elementary Proof of the Peters-Ritchie Theorem,” NELS 8, Amherst, MA, November, 1983. (reproduced in this volume.)
Chomsky, N. 1956, “Three models for the Description of Language,” IRE Transactions on Information Theory 2, 113–124.
Chomsky, N. 1959, “On Certain Formal Properties of Grammars,” Information and Control 2, 137–167.
Gazdar, G. 1981, “Unbounded Dependency and Coordinate Structure,” Linguistic Inquiry 12, 155–184. (reproduced in this volume.)
Gazdar, G. and G. K. Pullum, 1985, “Computationally Relevant Properties of Natural Languages and Their Grammars,” New Generation Computing, 3, 273–306. (reproduced in this volume.)
Ginsburg, S. and B. Partee, 1969, “A Mathematical Model of Transformational Grammars,” Information and Control 15, 297–334.
J. Higginbotham, 1984, “English is not a Context-Free Language,” Linguistic Inquiry 15, 225–234. (reproduced in this volume.)
Hopcroft, J. and J. Ullman, 1979, Introduction to Automata Theory, Languages and Computation, Addison- Wesley, Reading, Mass.
Kuroda, S. Y., 1964, “Classes of Languages and Linear-Bounded Automata,” Information and Control 7, 207–223.
S. Peters, 1987, “What is Mathematical Linguistics?,” this volume.
Peters, S. and R. Ritchie, 1971, “On Restricting the Base Component of Transformational Grammars,” Information and Control 18, 493–501.
G. K. Pullum and G. Gazdar, 1982, “Natural Language and Context-Free Language,” Linguistics and Philosophy, 4, 471–504. (reproduced in this volume.)
S. Ruby and P.C. Fischer, 1965, “Translational Methods and Computational Complexity,” Proc. Sixth Annual IEEE Symp. on Switching Circuit Theory and Logical Design, 173–178.
Salomaa, A., 1971, “The Generative Capacity of Transformational Grammars of Ginsburg and Partee,” Information and Control 18, 227–232.
Savitch, W.J., 1973, “How to Make Arbitrary Grammars Look Like Context-Free Grammars,” SIAM Journal on Computing 2, 174–182.
T. Wasow, 1978, “On Constraining the Class of Transformational Languages,” Synthese 39, 81–104. (reproduced in this volume.)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 D. Reidel Publishing Company
About this chapter
Cite this chapter
Savitch, W.J. (1987). Context-Sensitive Grammar and Natural Language Syntax. In: Savitch, W.J., Bach, E., Marsh, W., Safran-Naveh, G. (eds) The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, vol 33. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3401-6_15
Download citation
DOI: https://doi.org/10.1007/978-94-009-3401-6_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-55608-047-0
Online ISBN: 978-94-009-3401-6
eBook Packages: Springer Book Archive