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 条
[41]   Analyzing and Integrating Dependency Parsers [J].
McDonald, Ryan ;
Nivre, Joakim .
COMPUTATIONAL LINGUISTICS, 2011, 37 (01) :197-230
[42]  
Mitchell M., 2013, P 2013 C EMP METH NA, P1643, DOI DOI 10.18653/V1/P19-1051
[43]  
Mullen T., 2004, P 2004 C EMP METH NA, P412
[44]  
Nguyen Thien Hai, 2015, P 2015 C EMP METH NA, P2509
[45]  
Peng Chen, 2020, Natural Language Processing and Chinese Computing. 9th CCF International Conference, NLPCC 2020. Proceedings. Lecture Notes in Artificial Intelligence Subseries of Lecture Notes in Computer Science (LNAI 12430), P654, DOI 10.1007/978-3-030-60450-9_52
[46]  
Peng HY, 2020, AAAI CONF ARTIF INTE, V34, P8600
[47]   Learning multi-grained aspect target sequence for Chinese sentiment analysis [J].
Peng, Haiyun ;
Ma, Yukun ;
Li, Yang ;
Cambria, Erik .
KNOWLEDGE-BASED SYSTEMS, 2018, 148 :167-176
[48]  
Pennington Jeffrey, 2014, Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), P1532, DOI DOI 10.3115/V1/D14-1162
[49]  
Peters ME, 2018, 2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), P1499, DOI 10.5771/9783845286846
[50]  
Phienthrakul T, 2009, LECT NOTES COMPUT SC, V5864, P583, DOI 10.1007/978-3-642-10684-2_65