HAL TEI export of lirmm-00538562 CCSD CC0 1.0 - Universal

HAL API Platform

 Polynomial Pregroup Grammars parse Context Sensitive Languages Anne Preller dcadcaa9efdc75ee71040937dc577db5 lirmm.fr 836894 181483-836894 Anne Preller dcadcaa9efdc75ee71040937dc577db5 lirmm.fr 2010-11-22 17:38:52 2025-08-13 03:07:43 2010-11-25 15:00:33 2010-12-10 2010-11-22 contributor Anne Preller dcadcaa9efdc75ee71040937dc577db5 lirmm.fr CCSD lirmm-00538562 https://hal-lirmm.ccsd.cnrs.fr/lirmm-00538562 preller:lirmm-00538562 <i>Linguistic Analysis</i>, 2010, 36 (Lambek Festschrift), pp.483-516 Linguistic Analysis, 2010, 36 (Lambek Festschrift), pp.483-516 HAL Authorization Sciences de l'Homme et de la Société CNRS - Centre national de la recherche scientifique Archives ouvertes de la Linguistique Exploration et Exploitation de Données Textuelles Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier Mathématiques, Informatique, Physique et Systèmes Université de Montpellier Université de Montpellier (2015-2021) Journal verion of research report lirmm-00412876 International No Yes Polynomial Pregroup Grammars parse Context Sensitive Languages Anne Preller dcadcaa9efdc75ee71040937dc577db5 lirmm.fr 836894 181483-836894 29818 0098-9053 Linguistic Analysis Michael Brame David R. Willingham 36 Lambek Festschrift 483-516 2010-12-10 English pregroup grammar incremental dependency parsing algorithm Old Georgian noun phrase Swiss-German subor- dinate clause Dutch subordinate clause mildly context sen- sitive language cross-serial dependency complement control proof graph type logical grammar Computer Science [cs]/Logic in Computer Science [cs.LO] Humanities and Social Sciences/Linguistics Journal articles Journal articles Journal articles

Pregroup grammars with a possibly infinite number of lexi- cal entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensi- tive natural language fragments of Dutch, Swiss-German or Old Georgian. A polynomial recognition and parsing algorithm han- dles the various grammars uniformly. It also computes a planar graph for the semantic cross-serial dependencies in the case of natural languages.

 Exploration et exploitation de données textuelles TEXTE 2021-12-31
LIRMM, 161 rue Ada, 34000 Montpellier
https://www.lirmm.fr/equipes/TEXTE/ 139590827 0000000405990488 199111950H https://ror.org/013yean28 Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier LIRMM 1995-01-01 2021-12-31
161 rue Ada - 34095 Montpellier
https://www.lirmm.fr 0000000120970141 https://ror.org/051escj72 Université de Montpellier UM 2021-12-31
163 rue Auguste Broussonnet - 34090 Montpellier
http://www.umontpellier.fr/ 02636817X 0000000122597504 https://ror.org/02feahw73 Centre National de la Recherche Scientifique CNRS 1939-10-19
https://www.cnrs.fr/