AMRs Assemble! Learning to Ensemble with Autoregressive Models for AMR Parsing

7Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we examine the current state-of-the-art in AMR parsing, which relies on ensemble strategies by merging multiple graph predictions. Our analysis reveals that the present models often violate AMR structural constraints. To address this issue, we develop a validation method, and show how ensemble models can exploit SMATCH metric weaknesses to obtain higher scores, but sometimes result in corrupted graphs. Additionally, we highlight the demanding need to compute the SMATCH score among all possible predictions. To overcome these challenges, we propose two novel ensemble strategies based on Transformer models, improving robustness to structural constraints, while also reducing the computational time. Our methods provide new insights for enhancing AMR parsers and metrics. Our code is available at github.com/babelscape/AMRs-Assemble.

Cite

CITATION STYLE

APA

Lorenzo, A. C. M., Cabot, P. L. H., & Navigli, R. (2023). AMRs Assemble! Learning to Ensemble with Autoregressive Models for AMR Parsing. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2, pp. 1595–1605). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.acl-short.137

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free