Efficiency of pregroups and the French noun phrase

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)
DOI 10.1007/s10849-005-1242-2
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,658
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Joachim Lambek (1968). The Mathematics of Sentence Structure. Journal of Symbolic Logic 33 (4):627-628.

Add more references

Citations of this work BETA
Anne Preller (2007). Toward Discourse Representation Via Pregroup Grammars. Journal of Logic, Language and Information 16 (2):173-194.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

31 ( #102,719 of 1,726,181 )

Recent downloads (6 months)

28 ( #34,733 of 1,726,181 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.