首页> 外文会议>Natural language processing and Chinese computing >Transition-Based Dependency Parsing with Long Distance Collocations
【24h】

Transition-Based Dependency Parsing with Long Distance Collocations

机译:具有长距离配置的基于过渡的依存关系解析

获取原文
获取原文并翻译 | 示例

摘要

Long distance dependency relation is one of the main challenges for the state-of-the-art transition-based dependency parsing algorithms. In this paper, we propose a method to improve the performance of transition-based parsing with long distance collocations. With these long distance collocations, our method provides an approximate global view of the entire sentence, which is a little bit similar to top-down parsing. To further improve the accuracy of decision, we extend the set of parsing actions with two more fine-grained actions based on the types of arcs. Experimental results show that our method improve the performance of parsing effectively, especially for long sentence.
机译:长距离依赖关系是最新的基于过渡的依赖关系解析算法的主要挑战之一。在本文中,我们提出了一种在长距离配置下提高基于过渡的解析性能的方法。有了这些长距离的搭配,我们的方法就可以提供整个句子的大致全局视图,这与自顶向下的解析有点类似。为了进一步提高决策的准确性,我们根据弧的类型,使用另外两个细粒度的动作扩展了解析动作的集合。实验结果表明,该方法有效地提高了解析性能,特别是对于长句子而言。

著录项

  • 来源
  • 会议地点 Nanchang(CN)
  • 作者单位

    Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China;

    Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China;

    Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-26 14:01:48

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号