2024/10/23 by Ana Ezquerro, Ezquerro, Ana, David Vilares +3 · 2 citations
Computer Science · #Data Management and Algorithms #Semantic Web and Ontologies #Advanced Database Systems and Queries
paper · pdf · doi:10.48550/arxiv.2410.17972
Various linearizations have been proposed to cast syntactic dependency parsing as sequence labeling. However, these approaches do not support more complex graph-based representations, such as semantic dependencies or enhanced universal dependencies, as they cannot handle reentrancy or cycles. By extending them, we define a range of unbounded and bounded linearizations that can be used to cast graph parsing as a tagging task, enlarging the toolbox of problems that can be solved under this paradigm. Experimental results on semantic dependency and enhanced UD parsing show that with a good choice of encoding, sequence-labeling dependency graph parsers combine high efficiency with accuracies close to the state of the art, in spite of their simplicity.