AMR Similarity Metrics from Principles

Juri Opitz, Letitia Parcalabescu, Anette Frank
1/29/2020
cs.CLcs.AI

Official code: Heidelberg-NLP/amr-metric-suite (11 stars, MIT, last commit 2023-06-15).

Abstract

Different metrics have been proposed to compare Abstract Meaning Representation (AMR) graphs. The canonical Smatch metric (Cai and Knight, 2013) aligns the variables of two graphs and assesses triple matches. The recent SemBleu metric (Song and Gildea, 2019) is based on the machine-translation metric Bleu (Papineni et al., 2002) and increases computational efficiency by ablating the variable-alignment. In this paper, i) we establish criteria that enable researchers to perform a principled assessment of metrics comparing meaning representations like AMR; ii) we undertake a thorough analysis of Smatch and SemBleu where we show that the latter exhibits some undesirable properties. For example, it does not conform to the identity of indiscernibles rule and introduces biases that are hard to control; iii) we propose a novel metric S$^2$match that is more benevolent to only very slight meaning deviations and targets the fulfilment of all established criteria. We assess its suitability and show its advantages over Smatch and SemBleu.

View on arXivView PDF

Code Implementations(1)

MIT

This project collects methods that enhance the comparison between AMR graphs.

110Shell, PythonJan 27, 20203 years agoMIT

Similar Papers

Cite this paper

@article{opitz2020similarity,
  title  = {AMR Similarity Metrics from Principles},
  author = {Juri Opitz and Letitia Parcalabescu and Anette Frank},
  year   = {2020},
  eprint = {2001.10929},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2001.10929}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2001.10929.svg)](https://codeofpaper.com/paper/2001.10929)

Discussion