How much of UCCA can be predicted from AMR?

• URL: http://arxiv.org/abs/2207.12174v1
• Date: Mon, 25 Jul 2022 13:13:34 GMT
• Title: How much of UCCA can be predicted from AMR?
• Authors: Siyana Pavlova (SEMAGRAMME, LORIA), Maxime Amblard (SEMAGRAMME, LORIA), Bruno Guillaume (SEMAGRAMME, LORIA)
• Abstract summary: We use a corpus-based approach to build two graph rewriting systems, a deterministic and a non-deterministic one. We present their evaluation and a number of ambiguities that we discovered while building our rules.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we consider two of the currently popular semantic frameworks: Abstract Meaning Representation (AMR)a more abstract framework, and Universal Conceptual Cognitive Annotation (UCCA)-an anchored framework. We use a corpus-based approach to build two graph rewriting systems, a deterministic and a non-deterministic one, from the former to the latter framework. We present their evaluation and a number of ambiguities that we discovered while building our rules. Finally, we provide a discussion and some future work directions in relation to comparing semantic frameworks of different flavors.

Related papers

• A Concept-Based Explainability Framework for Large Multimodal Models [52.37626977572413]
  We propose a dictionary learning based approach, applied to the representation of tokens. We show that these concepts are well semantically grounded in both vision and text. We show that the extracted multimodal concepts are useful to interpret representations of test samples.
  arXiv  Detail & Related papers  (2024-06-12T10:48:53Z)
• eRST: A Signaled Graph Theory of Discourse Relations and Organization [14.074017875514787]
  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.
  arXiv  Detail & Related papers  (2024-03-20T12:52:38Z)
• Coherent Entity Disambiguation via Modeling Topic and Categorical Dependency [87.16283281290053]
  Previous entity disambiguation (ED) methods adopt a discriminative paradigm, where prediction is made based on matching scores between mention context and candidate entities. We propose CoherentED, an ED system equipped with novel designs aimed at enhancing the coherence of entity predictions. We achieve new state-of-the-art results on popular ED benchmarks, with an average improvement of 1.3 F1 points.
  arXiv  Detail & Related papers  (2023-11-06T16:40:13Z)
• Retrofitting Multilingual Sentence Embeddings with Abstract Meaning Representation [70.58243648754507]
  We introduce a new method to improve existing multilingual sentence embeddings with Abstract Meaning Representation (AMR) Compared with the original textual input, AMR is a structured semantic representation that presents the core concepts and relations in a sentence explicitly and unambiguously. Experiment results show that retrofitting multilingual sentence embeddings with AMR leads to better state-of-the-art performance on both semantic similarity and transfer tasks.
  arXiv  Detail & Related papers  (2022-10-18T11:37:36Z)
• Making sense of spoken plurals [1.80476943513092]
  This study focuses on the semantics of noun singulars and their plural inflectional variants in English. One model (FRACSS) proposes that all singular-plural pairs should be taken into account when predicting plural semantics from singular semantics. The other model (CCA) argues that conceptualization for plurality depends primarily on the semantic class of the base word.
  arXiv  Detail & Related papers  (2022-07-05T10:44:26Z)
• Dialogue Meaning Representation for Task-Oriented Dialogue Systems [51.91615150842267]
  We propose Dialogue Meaning Representation (DMR), a flexible and easily extendable representation for task-oriented dialogue. Our representation contains a set of nodes and edges with inheritance hierarchy to represent rich semantics for compositional semantics and task-specific concepts. We propose two evaluation tasks to evaluate different machine learning based dialogue models, and further propose a novel coreference resolution model GNNCoref for the graph-based coreference resolution task.
  arXiv  Detail & Related papers  (2022-04-23T04:17:55Z)
• Formal context reduction in deriving concept hierarchies from corpora using adaptive evolutionary clustering algorithm star [15.154538450706474]
  The process of deriving concept hierarchies from corpora is typically a time-consuming and resource-intensive process. The resulting lattice of formal context is evaluated to the standard one using concept lattice-invariants. The results show that adaptive ECA* performs concept lattice faster than other mentioned competitive techniques in different fill ratios.
  arXiv  Detail & Related papers  (2021-07-10T07:18:03Z)
• Infusing Finetuning with Semantic Dependencies [62.37697048781823]
  We show that, unlike syntax, semantics is not brought to the surface by today's pretrained models. We then use convolutional graph encoders to explicitly incorporate semantic parses into task-specific finetuning.
  arXiv  Detail & Related papers  (2020-12-10T01:27:24Z)
• Comparison by Conversion: Reverse-Engineering UCCA from Syntax and Lexical Semantics [29.971739294416714]
  Building robust natural language understanding systems will require a clear characterization of whether and how various linguistic meaning representations complement each other. We evaluate the mapping between meaning representations from different frameworks using two complementary methods: (i) a rule-based converter, and (ii) a supervised delexicalized that parses to one framework using only information from the other as features.
  arXiv  Detail & Related papers  (2020-11-02T09:03:46Z)
• Normalizing Compositional Structures Across Graphbanks [67.7047900945161]
  We present a methodology for normalizing discrepancies between MRs at the compositional level. Our work significantly increases the match in compositional structure between MRs and improves multi-task learning.
  arXiv  Detail & Related papers  (2020-04-29T14:35:50Z)

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.