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

  • Yannick Parmentier
  • Wolfgang Maier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5221)

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 [1], which has been used for the implementation of an open-source parsing architecture.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boullier, P.: Range Concatenation Grammars. In: Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pp. 53–64 (2000)Google Scholar
  2. 2.
    Boullier, P.: Proposal for a Natural Language Processing Syntactic Backbone. INRIA report 3342 (1998)Google Scholar
  3. 3.
    Boullier, P.: On TAG and Multicomponent TAG Parsing. INRIA report 3668 (1999)Google Scholar
  4. 4.
    Kallmeyer, L., Lichte, T., Maier, W., Parmentier, Y., Dellert, J., Evang, K.: The Tübingen Linguistic Parsing Architecture (2008), http://sourcesup.cru.fr/tulipa
  5. 5.
    Schulte, C.: Programming Constraint Services. LNCS (LNAI), vol. 2302. Springer, Heidelberg (2002)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yannick Parmentier
    • 1
  • Wolfgang Maier
    • 2
  1. 1.CNRS-LORIAVandœuvre-Lès-Nancy CedexFrance
  2. 2.SFB 441Universität TübingenTübingenGermany

Personalised recommendations