【24h】

Universal Dependency Parsing from Scratch

机译:普遍依赖性解析从头开始

获取原文

摘要

This paper describes Stanford's system at the CoNLL 2018 UD Shared Task. We introduce a complete neural pipeline system that takes raw text as input, and performs all tasks required by the shared task, ranging from tokenization and sentence segmentation, to POS tagging and dependency parsing. Our single system submission achieved very competitive performance on big treebanks. Moreover, after fixing an unfortunate bug, our corrected system would have placed the 2nd, 1st, and 3rd on the official evaluation metrics LAS, MLAS, and BLEX, and would have outperformed all submission systems on low-resource treebank categories on all metrics by a large margin. We further show the effectiveness of different model components through extensive ablation studies.
机译:本文介绍了Stanford在Conll 2018 UD共享任务中的系统。我们介绍了一个完整的神经管道系统,将原始文本作为输入执行,并执行共享任务所需的所有任务,从令牌化和句子分段到POS标记和依赖性解析。我们的单一系统提交在大树库上实现了非常竞争力的表现。此外,在修复不幸的错误后,我们的更正系统将在官方评估指标LAS,MLAS和BLEX上放置第2,第1和第3次,并将在所有指标上的低资源TreeBank类别上表现优于所有提交系统大幅度。我们进一步通过广泛消融研究表明了不同模型组分的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号