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.