An Earley Parsing Algorithm for Range Concatenation Grammars - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

An Earley Parsing Algorithm for Range Concatenation Grammars

Laura Kallmeyer
  • Fonction : Auteur
  • PersonId : 848623
Wolfgang Maier
  • Fonction : Auteur
  • PersonId : 860368

Résumé

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.
Fichier non déposé

Dates et versions

inria-00393980 , version 1 (10-06-2009)

Identifiants

  • HAL Id : inria-00393980 , version 1

Citer

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⟩
120 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More