基于迁移的轻量级前馈网络分析
Transition-based Parsing with Lighter Feed-Forward Networks
摘要:
我们探讨是否有可能建立更轻的解析器,这是统计上相当于其相应的标准版本,为广泛的语言显示不同的结构和形态。作为测试平台,我们使用了在前馈网络上训练的通用依赖关系和基于转换的依赖关系解析器。对于这些,大多数现有的研究假设事实标准嵌入式功能,并依赖于预先计算技巧,以获得加速。我们将探讨如何减少这些特征及其大小,以及这是否会转化为对准确性影响可以忽略不计的速度提升。实验表明,孙子的功能,可以删除大多数树库没有显着的(负或正)LAS差异。他们还展示了嵌入的大小如何显着减少。
英文摘要:
We explore whether it is possible to build lighter parsers, that are statistically equivalent to their corresponding standard version, for a wide set of languages showing different structures and morphologies. As testbed, we use the Universal Dependencies and transition-based dependency parsers trained on feed-forward networks. For these, most existing research assumes de facto standard embedded features and relies on pre-computation tricks to obtain speed-ups. We explore how these features and their size can be reduced and whether this translates into speed-ups with a negligible impact on accuracy. The experiments show that grand-daughter features can be removed for the majority of treebanks without a significant (negative or positive) LAS difference. They also show how the size of the embeddings can be notably reduced.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。