Studia Logica

, Volume 87, Issue 2–3, pp 171–197

Linear Processing with Pregroups

Article

DOI: 10.1007/s11225-007-9087-0

Cite this article as:
Preller, A. Stud Logica (2007) 87: 171. doi:10.1007/s11225-007-9087-0

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.

Keywords

Pregroup grammars categorial grammars linear parsing algorithmic complexity coordinate structures distant constituents 

Copyright information

© Springer Science+Business Media B.V. 2007

Authors and Affiliations

  1. 1.LIRMM, CNRSMontpellierFrance

Personalised recommendations