Polynomial Pregroup Grammars parse Context Sensitive Languages - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Linguistic Analysis Year : 2010

Polynomial Pregroup Grammars parse Context Sensitive Languages

Abstract

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.
Fichier principal
Vignette du fichier
PrellerPPGa.pdf (247.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00538562 , version 1 (22-11-2010)

Identifiers

  • HAL Id : lirmm-00538562 , version 1

Cite

Anne Preller. Polynomial Pregroup Grammars parse Context Sensitive Languages. Linguistic Analysis, 2010, 36 (Lambek Festschrift), pp.483-516. ⟨lirmm-00538562⟩
166 View
157 Download

Share

Gmail Facebook X LinkedIn More