Neural Attentional Relation Extraction with Dual Dependency Trees

被引:3
|
作者
Li, Dong [1 ]
Lei, Zhi-Lei [1 ]
Song, Bao-Yan [1 ]
Ji, Wan-Ting [1 ]
Kou, Yue [2 ]
机构
[1] Liaoning Univ, Sch Informat, Shenyang 110036, Peoples R China
[2] Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Peoples R China
关键词
relation extraction; graph convolutional network (GCN); syntactic dependency tree; semantic dependency tree; NETWORKS;
D O I
10.1007/s11390-022-2420-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Relation extraction has been widely used to find semantic relations between entities from plain text. Dependency trees provide deeper semantic information for relation extraction. However, existing dependency tree based models adopt pruning strategies that are too aggressive or conservative, leading to insufficient semantic information or excessive noise in relation extraction models. To overcome this issue, we propose the Neural Attentional Relation Extraction Model with Dual Dependency Trees (called DDT-REM), which takes advantage of both the syntactic dependency tree and the semantic dependency tree to well capture syntactic features and semantic features, respectively. Specifically, we first propose novel representation learning to capture the dependency relations from both syntax and semantics. Second, for the syntactic dependency tree, we propose a local-global attention mechanism to solve semantic deficits. We design an extension of graph convolutional networks (GCNs) to perform relation extraction, which effectively improves the extraction accuracy. We conduct experimental studies based on three real-world datasets. Compared with the traditional methods, our method improves the F1 scores by 0.3, 0.1 and 1.6 on three real-world datasets, respectively.
引用
收藏
页码:1369 / 1381
页数:13
相关论文
共 50 条
  • [31] Lexicalized Dependency Paths Based Supervised Learning for Relation Extraction
    Sun, Huiyu
    Grishman, Ralph
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2022, 43 (03): : 861 - 870
  • [32] A fast and effective dependency graph kernel for PPI relation extraction
    Domonkos Tikk
    Peter Palaga
    Ulf Leser
    BMC Bioinformatics, 11
  • [33] Ontology of Human Relation Extraction based on Dependency Syntax Rules
    He, Long
    Qiu, Likun
    2017 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2017), 2017, : 1151 - 1157
  • [34] Relation Extraction using Dependency Tree Kernel for Bahasa Indonesia
    Esperanti, Ditari Salsabila
    Purwarianti, Ayu
    2016 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATICS - CONCEPTS, THEORY AND APPLICATION (ICAICTA), 2016,
  • [35] Entity Relation Extraction as Dependency Parsing in Visually Rich Documents
    Zhang, Yue
    Zhang, Bo
    Wang, Rui
    Cao, Junjie
    Li, Chen
    Bao, Zuyi
    2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021), 2021, : 2759 - 2768
  • [36] A fast and effective dependency graph kernel for PPI relation extraction
    Tikk, Domonkos
    Palaga, Peter
    Leser, Ulf
    BMC BIOINFORMATICS, 2010, 11
  • [37] Mining activation force defined dependency patterns for relation extraction
    Zhang, Chunyun
    Zhang, Yichang
    Xu, Weiran
    Ma, Zhanyu
    Leng, Yan
    Guo, Jun
    KNOWLEDGE-BASED SYSTEMS, 2015, 86 : 278 - 287
  • [38] Open Relation Extraction based on Core Dependency Phrase Clustering
    Ru, Chengsen
    Li, Shasha
    Tang, Jintao
    Gao, Yi
    Wang, Ting
    2017 IEEE SECOND INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC), 2017, : 398 - 404
  • [39] A Graph Convolutional Network With Multiple Dependency Representations for Relation Extraction
    Hu, Yanfeng
    Shen, Hong
    Liu, Wuling
    Min, Fei
    Qiao, Xue
    Jin, Kangrong
    IEEE ACCESS, 2021, 9 : 81575 - 81587
  • [40] Dependency Feature Learning Method for Table Filling for Relation Extraction
    Tang, Yuan
    Chen, Yanping
    Hu, Ying
    Huang, Ruizhang
    Qin, Yongbin
    Computer Engineering and Applications, 2024, 60 (13) : 143 - 151