Polynomial Pregroup Grammars parse Context Sensitive Languages
A slightly modified version has been published as an article in Linguistic analysis, HAL: lirmm-00538562 ; Pregroup grammars with a possibly infinite number of lexical 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 sensitive natural language fragments of Dutch, Swiss-German or Old Georgian. A polynomial recognition and parsing algorithm handles the various grammars uniformly. It also computes a planar g... Mehr ...
| Verfasser: | |
|---|---|
| Dokumenttyp: | report |
| Erscheinungsdatum: | 2009 |
| Verlag/Hrsg.: |
HAL CCSD
|
| Schlagwörter: | type logical grammar / pregroup grammar / proof graph / complement control / cross-serial dependency / mildly context sensitive language / Dutch subordinate clause / Swiss-German subordinate clause / Old Georgian noun phrase / incremental dependency parsing algorithm / [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] / [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL] |
| Sprache: | Englisch |
| Permalink: | https://search.fid-benelux.de/Record/base-27010557 |
| Datenquelle: | BASE; Originalkatalog |
| Powered By: | BASE |
| Link(s) : | https://hal-lirmm.ccsd.cnrs.fr/lirmm-00412876 |
A slightly modified version has been published as an article in Linguistic analysis, HAL: lirmm-00538562 ; Pregroup grammars with a possibly infinite number of lexical 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 sensitive natural language fragments of Dutch, Swiss-German or Old Georgian. A polynomial recognition and parsing algorithm handles the various grammars uniformly. It also computes a planar graph for the semantic cross-serial dependencies in the case of natural languages.