paper-with-me

홈 › Papers

Syntopical Graphs for Computational Argumentation Tasks

2021-08-01 · ACL 2021 5 · Joe Barrow, Rajiv Jain, Nedim Lipka, Franck Dernoncourt, Vlad Morariu, Varun Manjunatha, Douglas Oard, Philip Resnik, Henning Wachsmuth

Approaches to computational argumentation tasks such as stance detection and aspect detection have largely focused on the text of independent claims, losing out on potentially valuable context provided by the rest of the collection. We introduce a general approach to these tasks motivated by syntopical reading, a reading process that emphasizes comparing and contrasting viewpoints in order to improve topic understanding. To capture collection-level context, we introduce the syntopical graph, a data structure for linking claims within a collection. A syntopical graph is a typed multi-graph where nodes represent claims and edges represent different possible pairwise relationships, such as entailment, paraphrase, or support. Experiments applying syntopical graphs to the problems of detecting stance and aspects demonstrate state-of-the-art performance in each domain, significantly outperforming approaches that do not utilize collection-level information.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Stance Detection

Similar Papers 제목 키워드 기반

Hi-ArG: Exploring the Integration of Hierarchical Argumentation Graphs in Language Pretraining

2023-12-01 · Jingcong Liang, Rong Ye, Meng Han, Qi Zhang 외

The knowledge graph is a structure to store and represent knowledge, and recent studies have discussed its capability to assist language models for various applications. Some variations of knowledge graphs aim to record …

Knowledge Graphs

Expert Stance Graphs for Computational Argumentation

2016-08-01 · WS 2016 8 · Orith Toledo-Ronen, Roy Bar-Haim, Noam Slonim
Argument Mining

Interpreting Neural Networks as Gradual Argumentation Frameworks (Including Proof Appendix)

2020-12-10 · Nico Potyka

We show that an interesting class of feed-forward neural networks can be understood as quantitative argumentation frameworks. This connection creates a bridge between research in Formal Argumentation and Machine Learning…

BIG-bench Machine Learning

Structure-Aware Encodings of Argumentation Properties for Clique-width

2025-11-13 · Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes K. Fichte arxiv

Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently o…

Splitting Assumption-Based Argumentation Frameworks

2026-04-30 · Giovanni Buraglio, Wolfgang Dvorak, Stefan Woltran arxiv

Assumption-Based Argumentation (ABA) is a well-established formalism for modelling and reasoning over debates, with a wide range of applications. However, the high computational complexity of core reasoning tasks in ABA …