HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

An Earley Parsing Algorithm for Range Concatenation Grammars

Laura Kallmeyer 1 Wolfgang Maier 1 Yannick Parmentier 2
1 SFB 833 - Emmy Noether Project
2 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to compute the yields of non-terminals as late as possible. Experiments show that, compared to previous approaches, the constraint propagation helps to considerably decrease the number of items in the chart.
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00393980
Contributor : Yannick Parmentier Connect in order to contact the contributor
Submitted on : Wednesday, June 10, 2009 - 11:38:02 AM
Last modification on : Friday, February 4, 2022 - 3:14:22 AM

Identifiers

  • HAL Id : inria-00393980, version 1

Collections

CNRS | INRIA | LORIA | UNIV-LORRAINE | INRIA2

Citation

Laura Kallmeyer, Wolfgang Maier, Yannick Parmentier. An Earley Parsing Algorithm for Range Concatenation Grammars. Joint conference of the 47th Annual Meeting of the Association for Computational Linguistics and the 4th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing (ACL-IJCNLP 2009), Aug 2009, Suntec, Singapore. pp.9-12. ⟨inria-00393980⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

113

 

Contact                    Legal Notice                    Personal Data