Nonautoregressive Encoder-Decoder Neural Framework for End-to-End Aspect-Based Sentiment Triplet Extraction

被引:47
作者
Fei, Hao [1 ]
Ren, Yafeng [2 ]
Zhang, Yue [3 ]
Ji, Donghong [1 ]
机构
[1] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China
[2] Guangdong Univ Foreign Studies, Lab Language & Artificial Intelligence, Guangzhou 510420, Peoples R China
[3] Westlake Univ, Sch Engn, Hangzhou 310024, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Decoding; Sentiment analysis; Predictive models; Labeling; Analytical models; Transformers; Bipartite matching loss; encoder-decoder framework; natural language processing (NLP); nonautoregressive decoding; pointer network; sentiment analysis; NETWORK; MODEL;
D O I
10.1109/TNNLS.2021.3129483
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Aspect-based sentiment triplet extraction (ASTE) aims at recognizing the joint triplets from texts, i.e., aspect terms, opinion expressions, and correlated sentiment polarities. As a newly proposed task, ASTE depicts the complete sentiment picture from different perspectives to better facilitate real-world applications. Unfortunately, several major challenges, such as the overlapping issue and long-distance dependency, have not been addressed effectively by the existing ASTE methods, which limits the performance of the task. In this article, we present an innovative encoder-decoder framework for end-to-end ASTE. Specifically, the ASTE task is first modeled as an unordered triplet set prediction problem, which is satisfied with a nonautoregressive decoding paradigm with a pointer network. Second, a novel high-order aggregation mechanism is proposed for fully integrating the underlying interactions between the overlapping structure of aspect and opinion terms. Third, a bipartite matching loss is introduced for facilitating the training of our nonautoregressive system. Experimental results on benchmark datasets show that our proposed framework significantly outperforms the state-of-the-art methods. Further analysis demonstrates the advantages of the proposed framework in handling the overlapping issue, relieving long-distance dependency and decoding efficiency.
引用
收藏
页码:5544 / 5556
页数:13
相关论文
共 81 条
[21]  
Fernandez-Gonzalez Daniel., 2020, P 58 ANN M ASS COMPU, P7035
[22]  
Ghorbanian Fereshteh, 2020, ICCAI '20: Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence, P515, DOI 10.1145/3404555.3404646
[23]  
Glorot X., 2010, PROC 13 INT C ARTIF, P249
[24]  
Guo JL, 2020, 58TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2020), P376
[25]  
Hu MH, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P537
[26]  
Katiyar A, 2016, PROCEEDINGS OF THE 54TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1, P919
[27]   The Hungarian Method for the assignment problem [J].
Kuhn, HW .
NAVAL RESEARCH LOGISTICS, 2005, 52 (01) :7-21
[28]  
Kurita S, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P2420
[29]  
Li X., 2017, P 2017 C EMP METH NA, P2886
[30]  
Li X, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P4194