eRST: A Signaled Graph Theory of Discourse Relations and Organization

• URL: http://arxiv.org/abs/2403.13560v2
• Date: Wed, 28 Aug 2024 14:45:57 GMT
• Title: eRST: A Signaled Graph Theory of Discourse Relations and Organization
• Authors: Amir Zeldes, Tatsuya Aoyama, Yang Janet Liu, Siyao Peng, Debopam Das, Luke Gessler,
• Abstract summary: We present 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 present and evaluate a freely available corpus of English annotated according to our framework, encompassing 12 spoken and written genres with over 200K tokens.
• Score: 14.074017875514787
• License: http://creativecommons.org/licenses/by/4.0/
• 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 (SDRT), the Penn Discourse Treebank (PDTB) 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.

Related papers

• A Novel Dependency Framework for Enhancing Discourse Data Analysis [27.152245569974678]
  This study has as its primary focus the conversion of PDTB annotations into dependency structures. It employs refined BERT-based discourses to test the validity of the dependency data derived from the PDTB-style corpora in English, Chinese, and several other languages. The results show that the PDTB dependency data is valid and that there is a strong correlation between the two types of dependency distance.
  arXiv  Detail & Related papers  (2024-07-17T10:55:00Z)
• S$^2$GSL: Incorporating Segment to Syntactic Enhanced Graph Structure Learning for Aspect-based Sentiment Analysis [19.740223755240734]
  We propose S$2$GSL, incorporating Segment to Syntactic enhanced Graph Structure Learning for ABSA. S$2$GSL is featured with a segment-aware semantic graph learning and a syntax-based latent graph learning.
  arXiv  Detail & Related papers  (2024-06-05T03:44:35Z)
• Understanding In-Context Learning with a Pelican Soup Framework [27.144616560712493]
  We propose a theoretical framework to explain in-context learning for natural language processing. Our results demonstrate the efficacy of our framework to explain in-context learning.
  arXiv  Detail & Related papers  (2024-02-16T03:20:14Z)
• On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions [49.8110352174327]
  We assess attribution methods from a perspective not previously explored in the graph domain: retraining. The core idea is to retrain the network on important (or not important) relationships as identified by the attributions. We run our analysis on four state-of-the-art GNN attribution methods and five synthetic and real-world graph classification datasets.
  arXiv  Detail & Related papers  (2024-01-01T02:03:35Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• Disco-Bench: A Discourse-Aware Evaluation Benchmark for Language Modelling [70.23876429382969]
  We propose a benchmark that can evaluate intra-sentence discourse properties across a diverse set of NLP tasks. Disco-Bench consists of 9 document-level testsets in the literature domain, which contain rich discourse phenomena. For linguistic analysis, we also design a diagnostic test suite that can examine whether the target models learn discourse knowledge.
  arXiv  Detail & Related papers  (2023-07-16T15:18:25Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• Towards Unification of Discourse Annotation Frameworks [0.0]
  We will investigate the systematic relations between different frameworks and devise methods of unifying the frameworks. Although the issue of framework unification has been a topic of discussion for a long time, there is currently no comprehensive approach. We plan to use automatic means for the unification task and evaluate the result with structural complexity and downstream tasks.
  arXiv  Detail & Related papers  (2022-04-16T11:34:00Z)
• A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
  We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
  arXiv  Detail & Related papers  (2021-10-18T10:45:59Z)
• Unsupervised Knowledge Graph Alignment by Probabilistic Reasoning and Semantic Embedding [22.123001954919893]
  We propose an iterative framework named PRASE which is based on probabilistic reasoning and semantic embedding. The PRASE framework is compatible with different embedding-based models, and our experiments on multiple datasets have demonstrated its state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-05-12T11:27:46Z)
• DAGN: Discourse-Aware Graph Network for Logical Reasoning [83.8041050565304]
  We propose a discourse-aware graph network (DAGN) that reasons relying on the discourse structure of the texts. The model encodes discourse information as a graph with elementary discourse units (EDUs) and discourse relations, and learns the discourse-aware features via a graph network for downstream QA tasks.
  arXiv  Detail & Related papers  (2021-03-26T09:41:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.