An Earley Parsing Algorithm for Range Concatenation Grammars

Laura Kallmeyer 1 Wolfgang Maier 1 Yannick Parmentier 2
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.
Type de document :
Communication dans un congrès
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, 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00393980
Contributeur : Yannick Parmentier <>
Soumis le : mercredi 10 juin 2009 - 11:38:02
Dernière modification le : jeudi 11 janvier 2018 - 06:21:35

Identifiants

  • HAL Id : inria-00393980, version 1

Collections

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, 2009. 〈inria-00393980〉

Partager

Métriques

Consultations de la notice

182