Journal of Logic, Language and Information

, Volume 17, Issue 2, pp 141–160 | Cite as

Pregroup Grammars and Chomsky’s Earliest Examples

Article

Abstract

Pregroups are partially ordered monoids in which each element has two “adjoints”. Pregroup grammars provide a computational approach to natural languages by assigning to each word in the mental dictionary a type, namely an element of the pregroup freely generated by a partially ordered set of basic types. In this expository article, the attempt is made to introduce linguists to a pregroup grammar of English by looking at Chomsky’s earliest examples.

Keywords

Computational linguistics Categorial grammars Pregroup grammars 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buszkowski, W. (2001). Lambek grammars based on pregroups. In P. de Groote, et al. (Eds.), Logical aspects of computational linguistics (pp. 95–109). Springer LNAI 2099.Google Scholar
  2. Chomsky, N.: Syntactic structures. Mouton, The Hague (1957)Google Scholar
  3. Harris, Z.: A cyclic cancellation automaton for sentence well-formedness. International Computation Centre Bulletin 5, 69–94 (1966)Google Scholar
  4. Harris, Z.: Mathematical structure of language. Interscience Publishers, New York (1968)Google Scholar
  5. Lambek, J. (1999). Type grammar revisited. In F. Lamarche, et al. (Eds.), Logical aspects of computational linguistics (pp. 1–27). Springer LNAI 1582.Google Scholar
  6. Lambek, J.: Type grammars as pregroups. Grammar 4, 21–39 (2001)CrossRefGoogle Scholar
  7. Lambek, J.: A computational algebraic approach to English grammar. Syntax 7(2), 128–147 (2004)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of MathematicsMcGill UniversityMontrealCanada

Personalised recommendations