Argument Structure Prediction in Online Conversations: A Comparative Study of Modeling Paradigms and Task Architectures
Organizations: Fondazione Bruno Kessler, Povo 38123, Trento Italy · Universidade da Coruña, 15001 A Coruña Spain · IEGPS-CSIC, Spanish National Research Council, 15704 Santiago de Compostela Spain
Abstract
Argument structure prediction (ASP) constructs complete argument structures from discourse by identifying argumentative units and their relations. While recent work has explored diverse approaches---including unified neural models, multi-step pipelines, and prompt-based large language models (LLMs)---their relative trade-offs remain under-explored, particularly in dialogical settings. We present a systematic evaluation of ASP under strict schema constraints, comparing supervised fine-tuning and prompt-based LLMs across single- and multi-step task architectures, generating complete argument structures from dialogical input end-to-end. We benchmark them on three diverse dialogical corpora adapted from Inference Anchoring Theory into bipolar argument structures. Under a shared evaluation framework, we assess predictive performance, cross-domain generalization, schema compliance, and computational efficiency. Our results show that ASP remains a challenging task, with identifying argumentative relations emerging as the primary bottleneck, largely due to the implicit and context-dependent nature of dialogical argumentation. To facilitate future research, we release our data processing pipeline and end-to-end modeling framework for computational ASP on dialogical corpora.
Figures & tables
| Corpus | #Conv. (orig.) | AvgLen | #Units | #Support(%) | #Attack(%) | #LongR(%) |
| QT30 (train) | 669 (1478) | 299.2 | 6451 | 3580 (85.9) | 565 (14.1) | 277 (6.7) |
| QT30 (test) | 168 (1478) | 304.3 | 1559 | 871 (87.1) | 141 (12.9) | 76 (7.8) |
| US2016reddit | 152 (264) | 221.1 | 1666 | 895 (71.3) | 361 (28.7) | 315 (25.6) |
| RIP1 | 79 (204) | 406.3 | 765 | 386 (83.5) | 76 (16.5) | 113 (25) |
| Paradigm | Model | Arch. | Code (MC) |
| Fine-tuning | BiLSTM-ER | ss | FT |
| XLM-R-Long + XLM-R-Large | ms | FT | |
| Prompting | Qwen2.5-14B-Instruct | ss / ms | Q0, Q3, Q5 |
| DeepSeek-R1-Distill-Qwen-14B | ss / ms | D0, D3, D5 | |
| Gemma3-12B-it | ss / ms | G0, G3, G5 |
| QT30-test (168 conv.) | RIP1 (79 conv.) | |||||
| MC | SR(%) | T(s) | Tk | SR(%) | T(s) | Tk |
| Q0 ss | 96.4 +3.6 | 27.46 +0.6 | 210k +13k | 100.0 +0.0 | 37.38 +0.0 | 119k +0k |
| Q3 ss | 100.0 +0.0 | 34.49 +0.0 | 623k +0 | 98.7 +1.3 | 34.45 +0.0 | 301k +8k |
| Q5 ss | 100.0 +0.0 | 37.89 +0.0 | 830k +0 | 98.7 +1.3 | 37.3 +0.3 | 397k +10k |
| D3 ss | 100.0 +0.0 | 46.11 +0.0 | 646k +0 | 97.4 +0.0 | 48.78 +2.0 | 312k +4k |
| D5 ss | 100.0 +0.0 | 47.76 +0.0 | 847k +0 | 97.4 +0.0 | 52.18 +2.0 | 405k +4k |
| QT30-test | US2016reddit | RIP1 | ||||
| MC | AUE P/R | RTC P/R | AUE P/R | RTC P/R | AUE P/R | RTC P/R |
| FT ms | 0.32 / 0.35 | 0.12 / 0.06 | 0.42 / 0.36 | 0.08 / 0.04 | 0.28 / 0.44 | 0.12 / 0.08 |
| Q0 ss | 0.35 / 0.25 | 0.06 / 0.02 | 0.55 / 0.42 | 0.18 / 0.05 | 0.21 / 0.25 | 0.12 / 0.03 |
| Q3 ss | 0.52 / 0.61 | 0.33 / 0.16 | 0.64 / 0.64 | 0.35 / 0.16 | 0.32 / 0.38 | 0.25 / 0.06 |
| Q5 ms | 0.53 / 0.61 | 0.38 / 0.18 | 0.67 / 0.60 | 0.30 / 0.14 | 0.38 / 0.38 | 0.24 / 0.06 |
| Q5 ss | 0.51 / 0.64 | 0.44 / 0.22 | 0.65 / 0.65 | 0.41 / 0.17 | 0.34 / 0.43 | 0.27 / 0.08 |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| MC | U + | U - | E | R + | R - | C |
| QT30-test | ||||||
| FT ms | 1163 | 1022 | 1836 | 265 | 934 | 8 |
| Q0 ss | 647 | 1178 | 472 | 71 | 978 | 3 |
| Q3 ss | 883 | 630 | 851 | 207 | 825 | 13 |
| Q5 ms | 853 | 640 | 799 | 228 | 812 | 14 |
| Q5 ss | 982 | 569 | 921 | 204 | 763 | 18 |
Computational Argumentation
Computational argumentation studies how to represent, analyze, and apply arguments and their relationships using formal and computational methods.
See all 99 papers