Efficiency of pregroups and the French noun phrase

Abstract
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
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,621
Through your library
References found in this work BETA
The Mathematics of Sentence Structure.Joachim Lambek - 1968 - Journal of Symbolic Logic 33 (4):627-628.

Add more references

Citations of this work BETA
Toward Discourse Representation Via Pregroup Grammars.Anne Preller - 2007 - Journal of Logic, Language and Information 16 (2):173-194.
Linear Processing with Pregroups.Anne Preller - 2007 - Studia Logica 87 (2-3):171-197.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

33 ( #155,563 of 2,169,095 )

Recent downloads (6 months)

1 ( #345,850 of 2,169,095 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums