Reassessing Graph Linearization for Sequence-to-sequence AMR Parsing: On the Advantages and Limitations of Triple-Based Encoding

Jeongwoo Kang, Maximin Coavoux, Cédric Lopez, Didier Schwab
5/13/2025
cs.CL

No official code found. Best implementation: Emvista/Triple_AMR_Parser (1 star, last commit 2025-03-21).

Abstract

Sequence-to-sequence models are widely used to train Abstract Meaning Representation (Banarescu et al., 2013, AMR) parsers. To train such models, AMR graphs have to be linearized into a one-line text format. While Penman encoding is typically used for this purpose, we argue that it has limitations: (1) for deep graphs, some closely related nodes are located far apart in the linearized text (2) Penman's tree-based encoding necessitates inverse roles to handle node re-entrancy, doubling the number of relation types to predict. To address these issues, we propose a triple-based linearization method and compare its efficiency with Penman linearization. Although triples are well suited to represent a graph, our results suggest room for improvement in triple encoding to better compete with Penman's concise and explicit representation of a nested graph structure.

View on arXivView PDF

Code Implementations(1)

10Shell, PythonNov 4, 20241 years ago

Similar Papers

Cite this paper

@article{kang2025reassessing,
  title  = {Reassessing Graph Linearization for Sequence-to-sequence AMR Parsing: On the Advantages and Limitations of Triple-Based Encoding},
  author = {Jeongwoo Kang and Maximin Coavoux and Cédric Lopez and Didier Schwab},
  year   = {2025},
  eprint = {2505.08504},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.08504v1}
}

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

Discussion