Abstract

Abstract Several metrics have been proposed for assessing the similarity of (abstract) meaning representations (AMRs), but little is known about how they relate to human similarity ratings. Moreover, the current metrics have complementary strengths and weaknesses: Some emphasize speed, while others make the alignment of graph structures explicit, at the price of a costly alignment step. In this work we propose new Weisfeiler-Leman AMR similarity metrics that unify the strengths of previous metrics, while mitigating their weaknesses. Specifically, our new metrics are able to match contextualized substructures and induce n:m alignments between their nodes. Furthermore, we introduce a Benchmark for AMR Metrics based on Overt Objectives (Bamboo), the first benchmark to support empirical assessment of graph-based MR similarity metrics. Bamboo maximizes the interpretability of results by defining multiple overt objectives that range from sentence similarity objectives to stress tests that probe a metric’s robustness against meaning-altering and meaning- preserving graph transformations. We show the benefits of Bamboo by profiling previous metrics and our own metrics. Results indicate that our novel metrics may serve as a strong baseline for future work.

Highlights

  • Meaning representations aim at capturing the meaning of text in an explicit graph format

  • We describe the Wasserstein Weisfeiler Leman kernel (WWLK) (Togninalli et al, 2019) that is similar to Weisfeiler-Leman Kernel (WLK) but provides i) an alignment of atomic and non-atomic substructures and ii) a graded match of substructures

  • We describe the creation of BAMBOO, which aims to provide the first benchmark that allows researchers to empirically i) assess abstract meaning representation (AMR) metrics, ii) compare AMR metrics, and possibly iii) train AMR metrics

Read more

Summary

Introduction

Meaning representations aim at capturing the meaning of text in an explicit graph format. A prominent framework is abstract meaning representation (AMR), proposed by Banarescu et al (2013). AMR views sentences as rooted, directed, acyclic, labeled graphs. Their nodes are variables, attributes or (open-class) concepts and are connected with edges that express semantic relations. There are many use cases in which we need to compare or relate two AMR graphs.

Objectives
Methods
Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call