Journal of Logic, Language and Information 14 (4):423-444 (2005)
|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)|
|Through your library||Configure|
Similar books and articles
J. Lambek (2008). Pregroup Grammars and Chomsky's Earliest Examples. Journal of Logic, Language and Information 17 (2):141-160.
Raymond Turner (1985). Three Theories of Nominalized Predicates. Studia Logica 44 (2):165 - 186.
Aleksandra Kiślak-Malinowska (2007). On the Logic of Β -Pregroups. Studia Logica 87 (2-3):323 - 342.
Nissim Francez & Michael Kaminski (2007). Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Studia Logica 87 (2-3):295 - 321.
Wojciech Buszkowski (2007). Type Logics and Pregroups. Studia Logica 87 (2-3):145 - 169.
Joachim Lambek (2010). Exploring Feature Agreement in French with Parallel Pregroup Computations. Journal of Logic, Language and Information 19 (1):75-88.
Michael Kaminski (2010). Extending Free Pregroups with Lower Bounds. Studia Logica 95 (3):417 - 441.
Anne Preller (2007). Linear Processing with Pregroups. Studia Logica 87 (2-3):171 - 197.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,386 of 722,774 )
Recent downloads (6 months)0
How can I increase my downloads?