【24h】

Dependency-driven Relation Extraction with Attentive Graph Convolutional Networks

机译:依赖驱动的关系提取与细心图卷积网络

获取原文

摘要

Syntactic information, especially dependency trees, has been widely used by existing studies to improve relation extraction with better semantic guidance for analyzing the context information associated with the given entities. However, most existing studies suffer from the noise in the dependency trees, especially when they are automatically generated, so that intensively leveraging dependency information may introduce confusions to relation classification and necessary pruning is of great importance in this task. In this paper, we propose a dependency-driven approach for relation extraction with attentive graph convolutional networks (A-GCN). In this approach, an attention mechanism upon graph convolutional networks is applied to different contextual words in the dependency tree obtained from an off-the-shelf dependency parser, to distinguish the importance of different word dependencies. Consider that dependency types among words also contain important contextual guidance, which is potentially helpful for relation extraction, we also include the type information in A-GCN modeling. Experimental results on two English benchmark datasets demonstrate the effectiveness of our A-GCN, which outperforms previous studies and achieves state-of-the-art performance on both datasets.
机译:句法信息,特别是依赖树,已被现有的研究广泛使用,以改善与对给定实体相关的上下文信息的更好的语义引导来改进关系提取。然而,大多数现有研究患有依赖树中的噪声,特别是当它们被自动生成时,因此强烈地利用依赖信息可以引入对关系分类的混淆,并且在这项任务中非常重要。在本文中,我们提出了一种与细心图卷积网络(A-GCN)的关系提取的依赖性驱动方法。在这种方法中,将图形卷积网络的注意机制应用于从废弃依赖性解析器获得的依赖树中的不同上下文词,以区分不同词依赖性的重要性。考虑单词之间的依赖类型还包含重要的上下文指导,这可能有助于提取,我们还包括A-GCN建模中的类型信息。两个英语基准数据集上的实验结果证明了我们的A-GCN的有效性,这优于以前的研究,并在两个数据集上实现最先进的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号