Skip to main content

Context-Sensitive Grammar and Natural Language Syntax

  • Chapter

Part of the book series: Studies in Linguistics and Philosophy ((SLAP,volume 33))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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.)

    Google Scholar 

  • Chomsky, N. 1956, “Three models for the Description of Language,” IRE Transactions on Information Theory 2, 113–124.

    Article  Google Scholar 

  • Chomsky, N. 1959, “On Certain Formal Properties of Grammars,” Information and Control 2, 137–167.

    Article  MathSciNet  MATH  Google Scholar 

  • Gazdar, G. 1981, “Unbounded Dependency and Coordinate Structure,” Linguistic Inquiry 12, 155–184. (reproduced in this volume.)

    Google Scholar 

  • 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.)

    Article  Google Scholar 

  • Ginsburg, S. and B. Partee, 1969, “A Mathematical Model of Transformational Grammars,” Information and Control 15, 297–334.

    Article  MathSciNet  MATH  Google Scholar 

  • J. Higginbotham, 1984, “English is not a Context-Free Language,” Linguistic Inquiry 15, 225–234. (reproduced in this volume.)

    Google Scholar 

  • Hopcroft, J. and J. Ullman, 1979, Introduction to Automata Theory, Languages and Computation, Addison- Wesley, Reading, Mass.

    MATH  Google Scholar 

  • Kuroda, S. Y., 1964, “Classes of Languages and Linear-Bounded Automata,” Information and Control 7, 207–223.

    Article  MathSciNet  MATH  Google Scholar 

  • S. Peters, 1987, “What is Mathematical Linguistics?,” this volume.

    Google Scholar 

  • Peters, S. and R. Ritchie, 1971, “On Restricting the Base Component of Transformational Grammars,” Information and Control 18, 493–501.

    MathSciNet  Google Scholar 

  • G. K. Pullum and G. Gazdar, 1982, “Natural Language and Context-Free Language,” Linguistics and Philosophy, 4, 471–504. (reproduced in this volume.)

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Salomaa, A., 1971, “The Generative Capacity of Transformational Grammars of Ginsburg and Partee,” Information and Control 18, 227–232.

    Article  MathSciNet  MATH  Google Scholar 

  • Savitch, W.J., 1973, “How to Make Arbitrary Grammars Look Like Context-Free Grammars,” SIAM Journal on Computing 2, 174–182.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Wasow, 1978, “On Constraining the Class of Transformational Languages,” Synthese 39, 81–104. (reproduced in this volume.)

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics