Splitting EUD graphs into trees: A quick and clatty approach
Not on the map. Why?
Abstract (arXiv)
We present the system submission from the FASTPARSE team for the EUD Shared Task at IWPT 2021. We engaged in the task last year by focusing on efficiency. This year we have focused on experimenting with new ideas on a limited time budget. Our system is based on splitting the EUD graph into several trees, based on linguistic criteria. We predict these trees using a sequence-labelling parser and combine them into an EUD graph. The results were relatively poor, although not a total disaster and could probably be improved with some polishing of the system's rough edges.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 18 references that are in the map. First posted on arXiv 24 Jun 2021.
Builds on
9 of 18 references.
References · 9
- 2016Enriching Word Vectors with Subword Informationcited by 1,583
- 2019Viable Dependency Parsing as Sequence Labelingcited by 34
- 2018Constituent Parsing as Sequence Labelingcited by 26
- 2020Bracketing Encodings for 2-Planar Dependency Parsingcited by 15
- 2019Parsing All: Syntax and Semantics, Dependencies and Spanscited by 13
- 2019Sequence Labeling Parsing by Learning Across Representationscited by 10
- 2021A Modest Pareto Optimisation Analysis of Dependency Parsers in 2021cited by 9
- 2020Efficient EUD Parsingcited by 8
- 2018A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsingcited by 1
Built on by
Citing papers per year: 2021: 1.
1 paper.