Journal of Logic, Language and Information 14 (4):423-444 (2005)
We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n3 to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented. This algorithm is then specified to run in linear time. A sufficient condition for a language fragment that makes the linear algorithm complete is given.
|Keywords||categorial grammars pregroups decision procedure recognition algorithm algorithmic complexity French noun phrase|
|Categories||categorize this paper)|
References found in this work BETA
The Mathematics of Sentence Structure.Joachim Lambek - 1968 - Journal of Symbolic Logic 33 (4):627-628.
Citations of this work BETA
Toward Discourse Representation Via Pregroup Grammars.Anne Preller - 2007 - Journal of Logic, Language and Information 16 (2):173-194.
Similar books and articles
Pregroup Grammars and Chomsky's Earliest Examples.J. Lambek - 2008 - Journal of Logic, Language and Information 17 (2):141-160.
Issues in the Semantics and Pragmatics of Definite Descriptions in English.Barbara Abbott - manuscript
On the Logic of Β -Pregroups.Aleksandra Kiślak-Malinowska - 2007 - Studia Logica 87 (2-3):323 - 342.
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 downloads33 ( #155,563 of 2,169,095 )
Recent downloads (6 months)1 ( #345,850 of 2,169,095 )
How can I increase my downloads?