eRST: A Signaled Graph Theory of Discourse Relations and Organization
Abstract In this article we present Enhanced Rhetorical Structure Theory (eRST), a new theoretical framework for computational discourse analysis, based on an expansion of Rhetorical Structure Theory (RST). The framework encompasses discourse relation graphs with tree-breaking, non-projective and concurrent relations, as well as implicit and explicit signals which give explainable rationales to our analyses. We survey shortcomings of RST and other existing frameworks, such as Segmented Discourse Representation Theory, the Penn Discourse Treebank, and Discourse Dependencies, and address these using constructs in the proposed theory. We provide annotation, search, and visualization tools for data, and present and evaluate a freely available corpus of English annotated according to our framework, encompassing 12 spoken and written genres with over 200K tokens. Finally, we discuss automatic parsing, evaluation metrics, and applications for data in our framework.
Authors
- Tatsuya Aoyama
- Siyao Peng
- Yang Janet Liu
- Luke Gessler (ORCID: https://orcid.org/0000-0002-4996-9045)
- Debopam Das (ORCID: https://orcid.org/0000-0003-4958-7466)
- Amir Zeldes (ORCID: https://orcid.org/0000-0001-8016-6753)
Institutions
- Butler University (US)
- Åbo Akademi University (FI)
- Georgetown University (US)
- LMU Klinikum (DE)
- Indiana University Bloomington (US)
- Ludwig-Maximilians-Universität München (DE)
Publication Details
- Journal
- Computational Linguistics
- Published
- 2024-09-19
- DOI
- https://doi.org/10.1162/coli_a_00538
- Citations
- 3
- Primary Topic
- Semantic Web and Ontologies
- Type
- article
- Field-Weighted Citation Impact
- 1.04