Pregroup Grammars and Chomsky’s Earliest Examples
- 87 Downloads
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.
KeywordsComputational linguistics Categorial grammars Pregroup grammars
Unable to display preview. Download preview PDF.
- 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
- Chomsky, N.: Syntactic structures. Mouton, The Hague (1957)Google Scholar
- Harris, Z.: A cyclic cancellation automaton for sentence well-formedness. International Computation Centre Bulletin 5, 69–94 (1966)Google Scholar
- Harris, Z.: Mathematical structure of language. Interscience Publishers, New York (1968)Google Scholar
- 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