An Earley Parsing Algorithm for Range Concatenation Grammars
An Earley Parsing Algorithm for Range Concatenation Grammars
复制标题
范围连接文法的 Earley 解析算法
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Y. Parmentier
中科院分区：
文献类型：
--
作者：
Laura Kallmeyer;Wolfgang Maier;Y. Parmentier
利用演绎分析框架，提出了一种Cyk和Earley风格的范围连接语法(RCG)分析算法。Earley解析器的特点是我们使用了一种范围边界约束传播技术来尽可能晚地计算非终结点的产量。实验表明，与以往的方法相比，约束传播方法大大减少了图中的项数。
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.