Claim Optimization in Computational Argumentation

12Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An optimal delivery of arguments is key to persuasion in any debate, both for humans and for AI systems. This requires the use of clear and fluent claims relevant to the given debate. Prior work has studied the automatic assessment of argument quality extensively. Yet, no approach actually improves the quality so far. To fill this gap, this paper proposes the task of claim optimization: to rewrite argumentative claims in order to optimize their delivery. As multiple types of optimization are possible, we approach this task by first generating a diverse set of candidate claims using a large language model, such as BART, taking into account contextual information. Then, the best candidate is selected using various quality metrics. In automatic and human evaluation on an English-language corpus, our quality-based candidate selection outperforms several baselines, improving 60% of all claims (worsening 16% only). Follow-up analyses reveal that, beyond copy editing, our approach often specifies claims with details, whereas it adds less evidence than humans do. Moreover, its capabilities generalize well to other domains, such as instructional texts.

Cite

CITATION STYLE

APA

Skitalinskaya, G., Spliethöver, M., & Wachsmuth, H. (2023). Claim Optimization in Computational Argumentation. In INLG 2023 - 16th International Natural Language Generation Conference, Proceedings of the Conference (pp. 134–152). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.inlg-main.10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free