Efficiency of Pregroups and the French Noun Phrase
| Autor: | Anne Preller, Sylvain Degeilh |
|---|---|
| Přispěvatelé: | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM) |
| Rok vydání: | 2005 |
| Předmět: |
Linguistics and Language
Semantics (computer science) Computer science media_common.quotation_subject [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] 02 engineering and technology computer.software_genre 01 natural sciences Reduction (complexity) Fragment (logic) 020204 information systems 0202 electrical engineering electronic engineering information engineering Computer Science (miscellaneous) 0101 mathematics Time complexity media_common Grammar business.industry 010102 general mathematics Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) 16. Peace & justice Noun phrase Algebra Linear algorithm Philosophy Determiner phrase Artificial intelligence business computer Natural language processing |
| Zdroj: | Journal of Logic, Language and Information Journal of Logic, Language and Information, Springer Verlag, 2005, 14 (4), pp.423-444 |
| ISSN: | 1572-9583 0925-8531 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink