Syntopical graphs for computational argumentation tasks
- authored by
- Joe Barrow, Rajiv Jain, Nedim Lipka, Franck Dernoncourt, Vlad I. Morariu, Varun Manjunatha, Douglas W. Oard, Philip Resnik, Henning Wachsmuth
- Abstract
Approaches to computational argumentation tasks such as stance detection and aspect detection have largely focused on the text of individual claims, losing out on potentially valuable context from the broader collection of text. We present 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 stance detection and aspect detection demonstrate state-of-the-art performance in each domain, significantly outperforming approaches that do not utilize collection-level information.
- External Organisation(s)
-
University of Maryland
Adobe Research
Paderborn University
- Type
- Conference contribution
- Pages
- 1583-1595
- No. of pages
- 13
- Publication date
- 2021
- Publication status
- Published
- Peer reviewed
- Yes
- ASJC Scopus subject areas
- Software, Computational Theory and Mathematics, Linguistics and Language, Language and Linguistics
- Electronic version(s)
-
https://doi.org/10.18653/v1/2021.acl-long.126 (Access:
Open)