End-to-End Argument Mining as Augmented Natural Language Generation
- URL: http://arxiv.org/abs/2406.08606v1
- Date: Wed, 12 Jun 2024 19:22:29 GMT
- Title: End-to-End Argument Mining as Augmented Natural Language Generation
- Authors: Nilmadhab Das, Vishal Choudhary, V. Vijaya Saradhi, Ashish Anand,
- Abstract summary: This work proposes a unified end-to-end framework based on a generative paradigm, in which the argumentative structures are framed into label-augmented text.
Through different marker-based fine-tuning strategies, we present an extensive study by integrating marker knowledge into our generative model.
The proposed framework achieves competitive results to the state-of-the-art (SoTA) model and outperforms several baselines.
- Score: 0.8213829427624407
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Argument Mining (AM) is a crucial aspect of computational argumentation, which deals with the identification and extraction of Argumentative Components (ACs) and their corresponding Argumentative Relations (ARs). Most prior works have solved these problems by dividing them into multiple subtasks. And the available end-to-end setups are mostly based on the dependency parsing approach. This work proposes a unified end-to-end framework based on a generative paradigm, in which the argumentative structures are framed into label-augmented text, called Augmented Natural Language (ANL). Additionally, we explore the role of different types of markers in solving AM tasks. Through different marker-based fine-tuning strategies, we present an extensive study by integrating marker knowledge into our generative model. The proposed framework achieves competitive results to the state-of-the-art (SoTA) model and outperforms several baselines.
Related papers
- Can Large Language Models perform Relation-based Argument Mining? [15.362683263839772]
Argument mining (AM) is the process of automatically extracting arguments, their components and/or relations amongst arguments and components from text.
Relation-based AM (RbAM) is a form of AM focusing on identifying agreement (support) and disagreement (attack) relations amongst arguments.
We show that general-purpose Large Language Models (LLMs), appropriately primed and prompted, can significantly outperform the best performing (RoBERTa-based) baseline.
arXiv Detail & Related papers (2024-02-17T10:37:51Z) - AMERICANO: Argument Generation with Discourse-driven Decomposition and
Agent Interaction [28.534689653798804]
We propose Americano, a novel framework with agent interaction for argument generation.
Our approach decomposes the generation process into sequential actions grounded on argumentation theory.
Our method outperforms both end-to-end and chain-of-thought prompting methods.
arXiv Detail & Related papers (2023-10-31T10:47:33Z) - A Unifying Framework for Learning Argumentation Semantics [50.69905074548764]
We present a novel framework, which uses an Inductive Logic Programming approach to learn the acceptability semantics for several abstract and structured argumentation frameworks in an interpretable way.
Our framework outperforms existing argumentation solvers, thus opening up new future research directions in the area of formal argumentation and human-machine dialogues.
arXiv Detail & Related papers (2023-10-18T20:18:05Z) - Cross-Genre Argument Mining: Can Language Models Automatically Fill in
Missing Discourse Markers? [17.610382230820395]
We propose to automatically augment a given text with discourse markers such that all relations are explicitly signaled.
Our analysis unveils that popular language models taken out-of-the-box fail on this task.
We demonstrate the impact of our approach on an Argument Mining downstream task, evaluated on different corpora.
arXiv Detail & Related papers (2023-06-07T10:19:50Z) - Retrieval-Augmented Generative Question Answering for Event Argument
Extraction [66.24622127143044]
We propose a retrieval-augmented generative QA model (R-GQA) for event argument extraction.
It retrieves the most similar QA pair and augments it as prompt to the current example's context, then decodes the arguments as answers.
Our approach outperforms substantially prior methods across various settings.
arXiv Detail & Related papers (2022-11-14T02:00:32Z) - Dialogue Meaning Representation for Task-Oriented Dialogue Systems [51.91615150842267]
We propose Dialogue Meaning Representation (DMR), a flexible and easily extendable representation for task-oriented dialogue.
Our representation contains a set of nodes and edges with inheritance hierarchy to represent rich semantics for compositional semantics and task-specific concepts.
We propose two evaluation tasks to evaluate different machine learning based dialogue models, and further propose a novel coreference resolution model GNNCoref for the graph-based coreference resolution task.
arXiv Detail & Related papers (2022-04-23T04:17:55Z) - A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic.
This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
arXiv Detail & Related papers (2021-10-18T10:45:59Z) - Pack Together: Entity and Relation Extraction with Levitated Marker [61.232174424421025]
We propose a novel span representation approach, named Packed Levitated Markers, to consider the dependencies between the spans (pairs) by strategically packing the markers in the encoder.
Our experiments show that our model with packed levitated markers outperforms the sequence labeling model by 0.4%-1.9% F1 on three flat NER tasks, and beats the token concat model on six NER benchmarks.
arXiv Detail & Related papers (2021-09-13T15:38:13Z) - "Sharks are not the threat humans are": Argument Component Segmentation
in School Student Essays [3.632177840361928]
We apply a token-level classification to identify claim and premise tokens from a new corpus of argumentative essays written by middle school students.
We demonstrate that a BERT-based multi-task learning architecture (i.e., token and sentence level classification) adaptively pretrained on a relevant unlabeled dataset obtains the best results.
arXiv Detail & Related papers (2021-03-08T02:40:07Z) - Aspect-Based Argument Mining [2.3148470932285665]
We present the task of Aspect-Based Argument Mining (ABAM) with the essential subtasks of Aspect Term Extraction (ATE) and Nested Term Extraction (NS)
We consider aspects as the main point(s) argument units are addressing.
This information is important for further downstream tasks such as argument ranking, argument summarization and generation, as well as the search for counter-arguments on the aspect-level.
arXiv Detail & Related papers (2020-11-01T21:57:51Z) - A Dependency Syntactic Knowledge Augmented Interactive Architecture for
End-to-End Aspect-based Sentiment Analysis [73.74885246830611]
We propose a novel dependency syntactic knowledge augmented interactive architecture with multi-task learning for end-to-end ABSA.
This model is capable of fully exploiting the syntactic knowledge (dependency relations and types) by leveraging a well-designed Dependency Relation Embedded Graph Convolutional Network (DreGcn)
Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-04T14:59:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.