Skip to Main content Skip to Navigation
Book sections

Pregroup grammars with linear parsing of the French verb phrase

Abstract : The parsing algorithm for pregroup grammars presented here exploits regularities of types of a pregroup grammar. Sufficient conditions are given for the algorithm to be linear and complete. Its working is illustrated by a grammar which handles unbounded dependencies and agreement with clitics in French. The grammar includes control of the complement of the infinitive by modal and causal verbs.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00306504
Contributor : Anne Preller <>
Submitted on : Sunday, July 27, 2008 - 8:45:46 PM
Last modification on : Tuesday, December 4, 2018 - 3:12:02 PM
Long-term archiving on: : Friday, November 25, 2016 - 11:55:07 PM

File

PrellerPrince-LinearParsing.pd...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : lirmm-00306504, version 1

Collections

Citation

Anne Preller, Violaine Prince. Pregroup grammars with linear parsing of the French verb phrase. Claudia Casadio, Joachim Lambek. Computational Algebraic Approaches to Natural Language, Polimetrica, Milano-Italy, pp.53-84, 2008, 978-88-7699-125-7, 978-88-7699-126-4. ⟨lirmm-00306504⟩

Share

Metrics

Record views

219

Files downloads

526