Skip to Main content Skip to Navigation
Conference papers

Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing

Yannick Parmentier 1 Wolfgang Maier 2
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 SFB 833 - Emmy Noether Project
Abstract : Range Concatenation Grammar (RCG) is a formalism with interesting formal properties (it has a polynomial parsing time while being more powerful than Linear Context-Free Rewriting Systems). In this context, we present a constraint-based extension of the state-of-the-art RCG parsing algorithm of (Boullier, 2000), which has been used for the implementation of an open-source parsing architecture.
Keywords : Constraints Parsing Range Concatenation Grammar
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00304562
Contributor : Yannick Parmentier <>
Submitted on : Wednesday, July 23, 2008 - 10:49:28 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Links full text

istex

Identifiers

Collections

CNRS | INRIA | LORIA | UNIV-LORRAINE

Citation

Yannick Parmentier, Wolfgang Maier. Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing. Proceedings of the 6th International Conference on Natural Language Processing, GoTAL 2008, Chalmers University of Technology and University of Gothenburg, Aug 2008, Gothenburg, Sweden. pp.360-365, ⟨10.1007/978-3-540-85287-2_34⟩. ⟨inria-00304562⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

202

 

Contact                    Legal Notice                    Personal Data