Dependency Graph Parsing as Sequence Labeling
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.
Code (1)
Tasks
Dependency ParsingSimilar Papers 제목 키워드 기반
Viable Dependency Parsing as Sequence Labeling
We recast dependency parsing as a sequence labeling problem, exploring several encodings of dependency trees as labels. While dependency parsing by means of sequence labeling had been attempted in existing work, results …
Dependency ParsingSequence Labeling Parsing by Learning Across Representations
We use parsing as sequence labeling as a common framework to learn across constituency and dependency syntactic abstractions. To do so, we cast the problem as multitask learning (MTL). First, we show that adding a parsin…
Constituency ParsingDependency ParsingA Unifying Theory of Transition-based and Sequence Labeling Parsing
We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-b…
Dependency ParsingGrowing Trees on Sounds: Assessing Strategies for End-to-End Dependency Parsing of Speech
Direct dependency parsing of the speech signal -- as opposed to parsing speech transcriptions -- has recently been proposed as a task (Pupier et al. 2022), as a way of incorporating prosodic information in the parsing sy…
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Dependency Parsingspeech-recognition+1Bracketing Encodings for 2-Planar Dependency Parsing
We present a bracketing-based encoding that can be used to represent any 2-planar dependency tree over a sentence of length n as a sequence of n labels, hence providing almost total coverage of crossing arcs in sequence …
Dependency ParsingPOSSentence