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.
https://hal.inria.fr/inria-00304562
Contributeur : Yannick Parmentier
<>
Soumis le : mercredi 23 juillet 2008 - 10:49:28
Dernière modification le : jeudi 11 janvier 2018 - 06:21:35
Yannick Parmentier, Wolfgang Maier. Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing. Bengt Nordström, Aarne Ranta. Proceedings of the 6th International Conference on Natural Language Processing, GoTAL 2008, Aug 2008, Gothenburg, Sweden. Springer Berlin-Heidelberg, pp.360-365, 2008, LNCS/LNAI 5221. 〈http://www.springer.com/fr/book/9783540852865〉. 〈10.1007/978-3-540-85287-2_34〉. 〈inria-00304562〉
