Grammar Formalisms for Natural Languages

Part of the Cognitive Technologies book series (COGTECH, volume 0)


For a long time there has been a debate about whether CFGs are sufficiently powerful to describe natural languages. Several approaches have used CFGs, oftentimes enriched with some additional mechanism of transformation (Chomsky, 1956) or with features (Gazdar et al., 1985) for natural languages. These approaches were able to treat a large range of linguistic phenomena.

However, in the 1980s Stuart Shieber was able to prove in (1985) that there are natural languages that cannot be generated by a CFG. Before that, Bresnan et al. (1982) made a similar argument but their proof is based on the tree structures obtained with CFGs while Shieber argues on the basis of weak generative capacity, i.e., of the string languages.


Natural Language Regular Language Derivation Tree Elementary Tree Grammar Formalism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Gazdar, Gerald, Ewan Klein, Geoffrey Pullman, and Ivan Sag. 1985. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Massachusetts.Google Scholar
  2. Frank, Robert. 2002. Phrase Structure Composition and Syntactic Dependencies. MIT Press, Cambridge, Mass.Google Scholar
  3. Chomsky, Noam. 1956. Three models for the description of language. IRE Transactions on Information Theory, 2:113—124.CrossRefGoogle Scholar
  4. Seki, Hiroyuki, Takahashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88(2):191–229.CrossRefGoogle Scholar
  5. Parikh, Rohit 1966. On context-free languages. Jounal of the ACM, 13:570–581.CrossRefGoogle Scholar
  6. Kroch, Anthony S. 1987. Unbounded dependencies and subjacency in a Tree Adjoining Grammar. In A. Manaster-Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam, pages 143–172.Google Scholar
  7. Schabes, Yves and K.Vijay-Shanker. 1990. Deterministic left to right parsing of tree adjoining languages. In Proceedings of ACL, Pittsburgh.Google Scholar
  8. Shieber, Stuart M. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333–343. Reprinted in Savitch:87.CrossRefGoogle Scholar
  9. Boullier, Pierre. 1996. Another facet of LIG parsing. In Proceedings of ACL 1996.Google Scholar
  10. Aho, A. V. 1968. Indexed grammars – an extension of context-free grammars. Journal of the ACM, 15(4):647–671.CrossRefGoogle Scholar
  11. Weir, David J. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.Google Scholar
  12. Vijay-Shanker, K. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania.Google Scholar
  13. Kroch, Anthony. 1989. Asymmetries in long-distance extraction in a Tree Adjoining Grammar. In Baltin and Kroch, editors, Alternative Conceptions of Phrase Structure. University of Chicago.Google Scholar
  14. Kuhlmann, Marco. 2007. Dependency Structures and Lexicalized Grammars. Ph.D. thesis, Saarland University.Google Scholar
  15. Frank, Robert. 1992. Syntactic Locality and Tree Adjoining Grammar: Grammatical, Acquisition and Processing Perspectives. Ph.D. thesis, University of Pennsylvania.Google Scholar
  16. Gazdar, Gerald. 1988. Applicability of indexed grammars to natural languages. In Uwe Reyle and Christian Rohrer, editors, Natural Language Parsing and Linguistic Theories. D. Reidel, pages 69–94.Google Scholar
  17. Bresnan, Joean, Ronald M. Kaplan, Stanley Peters, and Annie Zaenen. 1982. Cross-serial dependencies in Dutch. Linguistic Inquiry, 13(4):613–635. Reprinted in Savitch:87.Google Scholar
  18. Joshi, Aravind K. 1985. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In D. Dowty, L. Karttunen, and A. Zwicky, editors, Natural Language Parsing. Cambridge University Press, pages 206–250.Google Scholar
  19. Radzinski, Daniel. 1991. Chinese number-names, tree adjoining languages, and mild context-sensitivity. Computational Linguistics, 17:277–299.Google Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.SFB 833Universität TübingenTübingenGermany

Personalised recommendations