Journal of Logic, Language and Information 17 (2):141-160 (2008)
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|
|Categories||categorize this paper)|
References found in this work BETA
Citations of this work BETA
No citations found.
Similar books and articles
Semantic Vector Models and Functional Models for Pregroup Grammars.Anne Preller & Mehrnoosh Sadrzadeh - 2011 - Journal of Logic, Language and Information 20 (4):419-443.
Should Pregroup Grammars Be Adorned with Additional Operations? To Michael Moortgat on His First Half Century.Joachim Lambek - 2007 - Studia Logica 87 (2/3):343 - 358.
Toward Discourse Representation Via Pregroup Grammars.Anne Preller - 2007 - Journal of Logic, Language and Information 16 (2):173-194.
Exploring Feature Agreement in French with Parallel Pregroup Computations.Joachim Lambek - 2010 - Journal of Logic, Language and Information 19 (1):75-88.
Added to index2009-01-28
Total downloads21 ( #239,692 of 2,177,979 )
Recent downloads (6 months)1 ( #317,206 of 2,177,979 )
How can I increase my downloads?