Skip to Main content Skip to Navigation
Journal articles

Linear Processing with Pregroups

Abstract : Pregroup grammars have a cubic recognition algorithm. Here, we define a correct and complete recognition and parsing algorithm and give sufficient conditions for the algorithm to run in linear time. These conditions are satisfied by a large class of pregroup grammars, including grammars that handle coordinate structures and distant constituents.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00184257
Contributor : Anne Preller <>
Submitted on : Tuesday, October 30, 2007 - 7:45:47 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Long-term archiving on: : Monday, September 24, 2012 - 2:47:08 PM

Identifiers

Collections

Citation

Anne Preller. Linear Processing with Pregroups. Studia Logica, Springer Verlag (Germany), 2007, 87 (2/3), pp.171-197. ⟨10.1007/s11225-007-9087-0⟩. ⟨lirmm-00184257⟩

Share

Metrics

Record views

181

Files downloads

368