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.
Similar content being viewed by others
References
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.
Chomsky, N.: Syntactic structures. Mouton, The Hague (1957)
Harris, Z.: A cyclic cancellation automaton for sentence well-formedness. International Computation Centre Bulletin 5, 69–94 (1966)
Harris, Z.: Mathematical structure of language. Interscience Publishers, New York (1968)
Lambek, J. (1999). Type grammar revisited. In F. Lamarche, et al. (Eds.), Logical aspects of computational linguistics (pp. 1–27). Springer LNAI 1582.
Lambek, J.: Type grammars as pregroups. Grammar 4, 21–39 (2001)
Lambek, J.: A computational algebraic approach to English grammar. Syntax 7(2), 128–147 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lambek, J. Pregroup Grammars and Chomsky’s Earliest Examples. J of Log Lang and Inf 17, 141–160 (2008). https://doi.org/10.1007/s10849-007-9053-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10849-007-9053-2