An Earley Parsing Algorithm for Range Concatenation Grammars

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: Journal
• Year: 2009
• Where: ACL
• Authors: Laura Kallmeyer, Wolfgang Maier, Yannick Parmentier
• Keywords: ACL 2009, Computational Linguistics, Constraint Propagation, Deductive Parsing Framework, Range Concatenation Grammar