Hierarchical Bracketing Encodings Work for Dependency Graphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ezquerro, Ana, Gómez-Rodríguez, Carlos, Vilares, David
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914032560111616
author Ezquerro, Ana
Gómez-Rodríguez, Carlos
Vilares, David
author_facet Ezquerro, Ana
Gómez-Rodríguez, Carlos
Vilares, David
contents We revisit hierarchical bracketing encodings from a practical perspective in the context of dependency graph parsing. The approach encodes graphs as sequences, enabling linear-time parsing with $n$ tagging actions, and still representing reentrancies, cycles, and empty nodes. Compared to existing graph linearizations, this representation substantially reduces the label space while preserving structural information. We evaluate it on a multilingual and multi-formalism benchmark, showing competitive results and consistent improvements over other methods in exact match accuracy.
format Preprint
id arxiv_https___arxiv_org_abs_2509_09388
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Hierarchical Bracketing Encodings Work for Dependency Graphs
Ezquerro, Ana
Gómez-Rodríguez, Carlos
Vilares, David
Computation and Language
We revisit hierarchical bracketing encodings from a practical perspective in the context of dependency graph parsing. The approach encodes graphs as sequences, enabling linear-time parsing with $n$ tagging actions, and still representing reentrancies, cycles, and empty nodes. Compared to existing graph linearizations, this representation substantially reduces the label space while preserving structural information. We evaluate it on a multilingual and multi-formalism benchmark, showing competitive results and consistent improvements over other methods in exact match accuracy.
title Hierarchical Bracketing Encodings Work for Dependency Graphs
topic Computation and Language
url https://arxiv.org/abs/2509.09388