Pith. sign in

REVIEW 1 cited by

Automatic Debate Evaluation with Argumentation Semantics and Natural Language Argument Graph Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.14647 v2 pith:D5V7KKLM submitted 2022-03-28 cs.CL

classification cs.CL
keywords argumentationautomaticlanguagenaturalargumentativedebatedebatesevaluation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AKReF: An argumentative knowledge representation framework for structured argumentation

    cs.CL 2025-05 conditional novelty 4.0 of 10

    AKReF converts annotated argumentative texts into argument knowledge graphs with inference rule nodes and modus ponens edges to expose implicit relations and undercut attacks.

Pith tools