arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.14282cs.CL
收藏

基于转换算法的固有依赖位移偏差

Inherent Dependency Displacement Bias of Transition-Based Algorithms

CITIC

Mark Anderson, Carlos Gómez-Rodríguez

摘要:

目前,依赖关系解析器使用了各种各样的基于转换的算法。经验研究表明,不同树库的性能不同,在一个树库上,一种算法优于另一种算法,而在另一个树库上,情况正好相反。通常没有什么可辨别的原因导致一种算法更适合某个树库,而不太适合另一个树库。在本文中,我们通过引入算法的固有依赖位移分布的概念来阐明这一点。这表征了算法在依赖位移方面的偏差,依赖位移量化了句法关系的距离和方向。我们发现,算法的固有分布的树库的位移分布的相似性是明显相关的算法的解析性能的树库,特别是具有高度显着和实质性的相关性的主要句子长度在通用Dependency树库。我们还得到的结果表明,一个更离散的依赖位移分析不会导致任何有意义的相关性。

英文摘要:

A wide variety of transition-based algorithms are currently used for dependency parsers. Empirical studies have shown that performance varies across different treebanks in such a way that one algorithm outperforms another on one treebank and the reverse is true for a different treebank. There is often no discernible reason for what causes one algorithm to be more suitable for a certain treebank and less so for another. In this paper we shed some light on this by introducing the concept of an algorithm's inherent dependency displacement distribution. This characterises the bias of the algorithm in terms of dependency displacement, which quantify both distance and direction of syntactic relations. We show that the similarity of an algorithm's inherent distribution to a treebank's displacement distribution is clearly correlated to the algorithm's parsing performance on that treebank, specifically with highly significant and substantial correlations for the predominant sentence lengths in Universal Dependency treebanks. We also obtain results which show a more discrete analysis of dependency displacement does not result in any meaningful correlations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑