Polynomial Pregroup Grammars parse Context Sensitive Languages

Journal verion of research report lirmm-00412876 ; International audience ; 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 cro... Mehr ...

Verfasser: Preller, Anne
Dokumenttyp: Artikel
Erscheinungsdatum: 2010
Verlag/Hrsg.: HAL CCSD
Schlagwörter: type logical grammar / pregroup grammar / proof graph / complement control / cross-serial dependency / mildly context sen- sitive language / Dutch subordinate clause / Swiss-German subor- dinate clause / Old Georgian noun phrase / incremental dependency parsing algorithm / [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] / [SHS.LANGUE]Humanities and Social Sciences/Linguistics
Sprache: Englisch
Permalink: https://search.fid-benelux.de/Record/base-27447619
Datenquelle: BASE; Originalkatalog
Powered By: BASE
Link(s) : https://hal-lirmm.ccsd.cnrs.fr/lirmm-00538562