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 [1], which has been used for the implementation of an open-source parsing architecture. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Parmentier, Y., & Maier, W. (2008). Using constraints over finite sets of integers for range concatenation grammar parsing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5221 LNAI, pp. 360–365). https://doi.org/10.1007/978-3-540-85287-2_34
Mendeley helps you to discover research relevant for your work.