Artem Chernodub, Oleksiy Oliynyk, Philipp Heidenreich, Alexander Bondarenko, Matthias Hagen, Chris Biemann, Alexander Panchenko
| Challenge: | Argumentation is a multi-disciplinary field that extends from philosophy and psychology to linguistics as well as to artificial intelligence. |
| Approach: | They propose to use TARGER to tagging arguments in free text and keyword-based retrieval of arguments from a web-scale corpus. |
| Outcome: | The proposed framework can be used without any reproducibility effort on the user's side and is easily portable to other domains and use cases. |
Similar Papers
A Neural Transition-based Model for Argumentation Mining (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for identifying argumentation structures are inefficient and class imbalanced. |
| Approach: | They propose a neural transition-based model that incrementally builds an argumentation graph by generating a sequence of actions. |
| Outcome: | The proposed model can handle tree and non-tree structured argumentation without structural constraints. |
Unsupervised Argumentation Mining in Student Essays (2020.lrec-1)
Copied to clipboard
| Challenge: | State-of-the-art argumentation mining systems rely on annotated training data and are supervised, thus relying on an annotation of the components and relationships between them. |
| Approach: | They propose to bootstrap from a small set of argument components automatically identified using simple heuristics in combination with reliable contextual cues. |
| Outcome: | The proposed approach outperforms two supervised baselines and achieves 73.5-83.7% of the performance of a state-of-the-art neural approach. |
Can Large Language Models perform Relation-based Argument Mining? (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods for RbAM fail to perform satisfactorily across different datasets. |
| Approach: | They propose to use relation-based argument mining to determine agreement (support) and disagreement (attack) relations amongst textual arguments in binary and ternary settings. |
| Outcome: | The proposed method outperforms the best performing (RoBERTa-based) baseline on two open-source LLMs and with GPT-3.5-turbo on several datasets for (binary and ternary) RbAM. |
Learning Strategies for Robust Argument Mining: An Analysis of Variations in Language and Domain (2024.lrec-main)
Copied to clipboard
| Challenge: | Argument mining is a complex process that requires a large amount of resources and time. |
| Approach: | They propose to analyze arguments in three different languages and domains to understand their robustness to natural language variations. |
| Outcome: | The proposed systems are more robust to natural language variations than existing arguments mining systems. |
End-to-end Argument Mining with Cross-corpora Multi-task Learning (2022.tacl-1)
Copied to clipboard
| Challenge: | Argument(ation) mining is a task of identifying argument structure from text . lack of training data makes it difficult to train models based on limited data sets. |
| Approach: | They propose an end-to-end cross-corpus argument mining method that uses auxiliary argument mining corpora to train models. |
| Outcome: | The proposed method outperforms models trained on a single corpus on arguments on arguments in argument mining tasks. |
Yes, we can! Mining Arguments in 50 Years of US Presidential Campaign Debates (P19-1)
Copied to clipboard
| Challenge: | Political debates are a natural application scenario for Argument Mining. |
| Approach: | They propose an argument mining approach to political debates that uses argument components to annotate 39 political debate from the last 50 years of US presidential campaigns. |
| Outcome: | The proposed approach outperforms baselines in argument mining over political debates. |
Argument Mining with Fine-Tuned Large Language Models (2025.coling-main)
Copied to clipboard
| Challenge: | Argument Mining (AM) pipelines use fine-tuned large language models (LLMs) . initial approaches employ supervised machine learning algorithms, such as Maximum Entropy classifiers and Logistic Regressions. |
| Approach: | They propose to model the three main AM sub-tasks as text generation tasks and fine-tune eight popular quantized and non-quantized large language models (LLMs) on the benchmark PE, AbstRCT, and CDCP datasets. |
| Outcome: | The proposed pipeline achieves state-of-the-art across all AM sub-tasks and datasets, showing significant improvements over previous benchmarks. |
DMON: A Simple Yet Effective Approach for Argument Structure Learning (2024.lrec-main)
Copied to clipboard
| Challenge: | Argument structure learning (ASL) involves examining relationships between sentences in unstructured text. |
| Approach: | They propose a dual-tower multi-scale cOnvolution neural network to analyze relationships between arguments in a text. |
| Outcome: | The proposed approach outperforms state-of-the-art models on three domain argument mining datasets. |
Multi-Task Learning for Argumentation Mining in Low-Resource Settings (N18-2)
Copied to clipboard
| Challenge: | Argument component identification is difficult for trained annotators to perform in a new domain or to develop new AM tasks. |
| Approach: | They investigate whether multi-task learning can improve performance on AM problems . they found that MTL performs particularly well when little training data is available for the main task . |
| Outcome: | The proposed approach performs better when little training data is available for the main task, a common scenario in AM. |
IAM: A Comprehensive and Large-Scale Dataset for Integrated Argument Mining Tasks (2022.acl-long)
Copied to clipboard
| Challenge: | Argument mining (AM) is a computational process that is used to analyze information in a debating system. |
| Approach: | They propose to use a large dataset to automate the manual process of debating . they propose to integrate claim extraction, stance classification and evidence extraction tasks . |
| Outcome: | The proposed tasks can extract claims, stances, evidence and more from a large dataset . the proposed tasks are highly efficient and can be applied to argument mining tasks . |