Transformer-Based Models for Automatic Identification of Argument Relations: A Cross-Domain Evaluation
원문 초록
Argument Mining is defined as the task of automatically identifying and extracting argumentative components (e.g., premises, claims, etc.) and detecting the existing relations among them (i.e., support, attack, rephrase, no relation). One of the main issues when approaching this problem is the lack of data, and the size of the publicly available corpora. In this work, we use the recently annotated US2016 debate corpus. US2016 is the largest existing argument annotated corpus, which allows exploring the benefits of the most recent advances in Natural Language Processing in a complex domain like Argument (relation) Mining. We present an exhaustive analysis of the behavior of transformer-based models (i.e., BERT, XLNET, RoBERTa, DistilBERT and ALBERT) when predicting argument relations. Finally, we evaluate the models in five different domains, with the objective of finding the less domain dependent model. We obtain a macro F1-score of 0.70 with the US2016 evaluation corpus, and a macro F1-score of 0.61 with the Moral Maze cross-domain corpus.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Towards Comprehensive Argument Analysis in Education: Dataset, Tasks, and Method
Leveraging Context for Multimodal Fallacy Classification in Political Debates
Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs
Chaining Event Spans for Temporal Relation Grounding
A MISMATCHED Benchmark for Scientific Natural Language Inference
MonkeyOCR: Document Parsing with a Structure-Recognition-Relation Triplet Paradigm
토론
이 논문과 연결된 포럼 글이 아직 없습니다.