Can Large Language Models perform Relation-based Argument Mining?
원문 초록
Argument mining (AM) is the process of automatically extracting arguments, their components and/or relations amongst arguments and components from text. As the number of platforms supporting online debate increases, the need for AM becomes ever more urgent, especially in support of downstream tasks. Relation-based AM (RbAM) is a form of AM focusing on identifying agreement (support) and disagreement (attack) relations amongst arguments. RbAM is a challenging classification task, with existing methods failing to perform satisfactorily. In this paper, we show that general-purpose Large Language Models (LLMs), appropriately primed and prompted, can significantly outperform the best performing (RoBERTa-based) baseline. Specifically, we experiment with two open-source LLMs (Llama-2 and Mistral) with ten datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.