AKReF converts annotated argumentative texts into argument knowledge graphs with inference rule nodes and modus ponens edges to expose implicit relations and undercut attacks.
Automatic Debate Evaluation with Argumentation Semantics and Natural Language Argument Graph Networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The lack of annotated data on professional argumentation and complete argumentative debates has led to the oversimplification and the inability of approaching more complex natural language processing tasks. Such is the case of the automatic debate evaluation. In this paper, we propose an original hybrid method to automatically evaluate argumentative debates. For that purpose, we combine concepts from argumentation theory such as argumentation frameworks and semantics, with Transformer-based architectures and neural graph networks. Furthermore, we obtain promising results that lay the basis on an unexplored new instance of the automatic analysis of natural language arguments.
citation-role summary
citation-polarity summary
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
AKReF: An argumentative knowledge representation framework for structured argumentation
AKReF converts annotated argumentative texts into argument knowledge graphs with inference rule nodes and modus ponens edges to expose implicit relations and undercut attacks.