Skip to main content

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,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.

We are grateful to Laura Kallmeyer and three anonymous reviewers for useful comments on this work.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Boullier, P.: Proposal for a Natural Language Processing Syntactic Backbone. INRIA report 3342 (1998)

    Google Scholar 

  3. Boullier, P.: On TAG and Multicomponent TAG Parsing. INRIA report 3668 (1999)

    Google Scholar 

  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. Schulte, C.: Programming Constraint Services. LNCS (LNAI), vol. 2302. Springer, Heidelberg (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parmentier, Y., Maier, W. (2008). Using Constraints over Finite Sets of Integers for Range Concatenation Grammar Parsing. In: Nordström, B., Ranta, A. (eds) Advances in Natural Language Processing. GoTAL 2008. Lecture Notes in Computer Science(), vol 5221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85287-2_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85287-2_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85286-5

  • Online ISBN: 978-3-540-85287-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics