SemBleu: A Robust Metric for AMR Parsing Evaluation

Linfeng Song, Daniel Gildea
5/26/2019
cs.CL

Official code: freesunshine0316/sembleu (12 stars, last commit 2021-02-22).

Abstract

Evaluating AMR parsing accuracy involves comparing pairs of AMR graphs. The major evaluation metric, SMATCH (Cai and Knight, 2013), searches for one-to-one mappings between the nodes of two AMRs with a greedy hill-climbing algorithm, which leads to search errors. We propose SEMBLEU, a robust metric that extends BLEU (Papineni et al., 2002) to AMRs. It does not suffer from search errors and considers non-local correspondences in addition to local ones. SEMBLEU is fully content-driven and punishes situations where a system's output does not preserve most information from the input. Preliminary experiments on both sentence and corpus levels show that SEMBLEU has slightly higher consistency with human judgments than SMATCH. Our code is available at http://github.com/freesunshine0316/sembleu.

View on arXivView PDF

Code Implementations(1)

SemBleu: A Robust Metric for AMR Parsing Evaluation

124Shell, PythonMay 20, 20195 years ago

Cite this paper

@article{song2019sembleu,
  title  = {SemBleu: A Robust Metric for AMR Parsing Evaluation},
  author = {Linfeng Song and Daniel Gildea},
  year   = {2019},
  eprint = {1905.10726},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1905.10726}
}

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/1905.10726.svg)](https://codeofpaper.com/paper/1905.10726)

Discussion