The DCU-EPFL Enhanced Dependency Parser at the IWPT 2021 Shared Task
Not on the map. Why?
Abstract (arXiv)
We describe the DCU-EPFL submission to the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies. The task involves parsing Enhanced UD graphs, which are an extension of the basic dependency trees designed to be more facilitative towards representing semantic structure. Evaluation is carried out on 29 treebanks in 17 languages and participants are required to parse the data from each language starting from raw strings. Our approach uses the Stanza pipeline to preprocess the text files, XLMRoBERTa to obtain contextualized token representations, and an edge-scoring and labeling model to predict the enhanced graph. Finally, we run a post-processing script to ensure all of our outputs are valid Enhanced UD graphs. Our system places 6th out of 9 participants with a coarse Enhanced Labeled Attachment Score (ELAS) of 83.57. We carry out additional post-deadline experiments which include using Trankit for pre-processing, XLM-RoBERTa-LARGE, treebank concatenation, and multitask learning between a basic and an enhanced dependency parser. All of these modifications improve our initial score and our final system has a coarse ELAS of 88.04.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 5 Jul 2021.
Builds on
18 of 31 references.
References · 18
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
- 2020Stanza: A Python Natural Language Processing Toolkit for Many Human Languagescited by 719
- 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
- 201975 Languages, 1 Model: Parsing Universal Dependencies Universallycited by 90
- 2021Trankit: A Light-Weight Transformer-based Toolkit for Multilingual Natural Language Processingcited by 68
- 2016Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representationscited by 55
- 2018Simpler but More Accurate Semantic Dependency Parsingcited by 46
- 2015Transition-Based Dependency Parsing with Stack Long Short-Term Memorycited by 45
6 more
- 2019Compositional Semantic Parsing Across Graphbankscited by 15
- 2020Efficient EUD Parsingcited by 8
- 2020Enhanced Universal Dependency Parsing with Second-Order Inference and Mixture of Training Datacited by 5
- 2020Kopsala: Transition-Based Graph Parsing via Efficient Training and Effective Encodingcited by 4
- 2020The ADAPT Enhanced Dependency Parser at the IWPT 2020 Shared Taskcited by 3
- 2019'UFAL MRPipe at MRP 2019: UDPipe Goes Semantic in the Meaning Representation Parsing Shared Taskcited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Transformers as Graph-to-Graph Modelscited by 5
- 2023Transformers as Graph-to-Graph Models27 Oct 2023