Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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

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.

Dates and versions

inria-00304562 , version 1 (23-07-2008)

Identifiers

Cite

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⟩
47 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More