Discontinuous parsing with continuous trees
Discontinuous parsing with continuous trees
复制标题
DOI：
10.18653/v1/w16-0906
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Wolfgang Maier;Timm Lichte
中科院分区：
文献类型：
--
作者：
Wolfgang Maier;Timm Lichte
我们介绍了一种新的方法，增量移位减少解析不连续的选区树，不连续的树可以转化为连续的树，通过改变终端节点的顺序的基础上。它允许一个不同的预言机的干净的公式，导致更快的解析器，并提供更好的结果。我们最好的系统在TIGER上达到了80.02的F1。
We introduce a new method for incremental shift-reduce parsing of discontinuous constituency trees, based on the fact that discontinuous trees can be transformed into continuous trees by changing the order of the terminal nodes. It allows for a clean formulation of different oracles, leads to faster parsers and provides better results. Our best system achieves an F 1 of 80.02 on TIGER.