Evaluation of Dependency Parsers on Unbounded Dependencies
Evaluation of Dependency Parsers on Unbounded Dependencies
复制标题
DOI：
--
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
Joakim Nivre;Laura Rimell;Ryan T. McDonald;Carlos Gómez-Rodríguez
中科院分区：
文献类型：
--
作者：
Joakim Nivre;Laura Rimell;Ryan T. McDonald;Carlos Gómez-Rodríguez
我们评估了两个依存解析器 MSTParser 和 MaltParser 恢复英语中无限依存关系的能力，这种评估类型已应用于基于语法的解析器和统计短语结构解析器，但不适用于依存解析器。评估表明，当与简单的后处理启发法相结合时，解析器在大约 50% 的时间内正确地回忆起无界依赖关系，这仅比两个专门为处理此类依赖关系而设计的基于语法的解析器稍差。
We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been applied to grammar-based parsers and statistical phrase structure parsers but not to dependency parsers. The evaluation shows that when combined with simple post-processing heuristics, the parsers correctly recall unbounded dependencies roughly 50% of the time, which is only slightly worse than two grammar-based parsers specifically designed to cope with such dependencies.