TDEER: An Efficient Translating Decoding Schema for Joint Extraction of Entities and Relations

被引:0
作者
Li, Xianming [1 ]
Luo, Xiaotian [1 ]
Dong, Chenghao [1 ]
Yang, Daichuan [1 ]
Luan, Beidi [1 ]
He, Zhen [1 ]
机构
[1] Ant Grp, Shanghai, Peoples R China
来源
2021 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2021) | 2021年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Joint extraction of entities and relations from unstructured texts to form factual triples is a fundamental task of constructing a Knowledge Base (KB). A common method is to decode triples by predicting entity pairs to obtain the corresponding relation. However, it is still challenging to handle this task efficiently, especially for the overlapping triple problem. To address such a problem, this paper proposes a novel efficient entities and relations extraction model called TDEER, which stands for Translating Decoding Schema for Joint Extraction of Entities and Relations. Unlike the common approaches, the proposed translating decoding schema regards the relation as a translating operation from subject to objects, i.e., TDEER decodes triples as subject + relation -> objects. TDEER can naturally handle the overlapping triple problem, because the translating decoding schema can recognize all possible triples, including overlapping and non-overlapping triples. To enhance model robustness, we introduce negative samples to alleviate error accumulation at different stages. Extensive experiments on public datasets demonstrate that TDEER produces competitive results compared with the state-of-the-art (SOTA) baselines. Furthermore, the computation complexity analysis indicates that TDEER is more efficient than powerful baselines. Especially, the proposed TDEER is 2 times faster than the recent SOTA models.
引用
收藏
页码:8055 / 8064
页数:10
相关论文
共 32 条
[1]  
[Anonymous], 2009, P JOINT C 47 ANN M A
[2]  
Bordes A., 2013, Advances in Neural Information Processing Systems, V26, P2787, DOI DOI 10.5555/2999792.2999923
[3]  
Chan YS, 2011, P 49 ANN M ASS COMP, P551
[4]  
Dai D, 2019, AAAI CONF ARTIF INTE, P6300
[5]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[6]   Open Question Answering Over Curated and Extracted Knowledge Bases [J].
Fader, Anthony ;
Zettlemoyer, Luke ;
Etzioni, Oren .
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, :1156-1165
[7]  
Fu TJ, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P1409
[8]  
Gupta P, 2016, P COLING 2016 26 INT, P2537
[9]  
Hoffmann Raphael, 2011, ANN M ASS COMP LING
[10]   Community challenges in biomedical text mining over 10 years: success, failure and the future [J].
Huang, Chung-Chi ;
Lu, Zhiyong .
BRIEFINGS IN BIOINFORMATICS, 2016, 17 (01) :132-144