Abstract
This paper presents our system at the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies. Using a biaffine classifier architecture (Dozat and Manning, 2017) which operates directly on finetuned RoBERTa embeddings, our parser generates enhanced UD graphs by predicting the best dependency label (or absence of a dependency) for each pair of tokens in the sentence. We address label sparsity issues by replacing lexical items in relations with placeholders at prediction time, later retrieving them from the parse in a rule-based fashion. In addition, we ensure structural graph constraints using a simple set of heuristics. On the English blind test data, our system achieves a very high parsing accuracy, ranking 1st out of 10 with an ELAS F1 score of 88.94%.- Anthology ID:
- 2020.iwpt-1.26
- Volume:
- Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies
- Month:
- July
- Year:
- 2020
- Address:
- Online
- Editors:
- Gosse Bouma, Yuji Matsumoto, Stephan Oepen, Kenji Sagae, Djamé Seddah, Weiwei Sun, Anders Søgaard, Reut Tsarfaty, Dan Zeman
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 245–252
- Language:
- URL:
- https://aclanthology.org/2020.iwpt-1.26
- DOI:
- 10.18653/v1/2020.iwpt-1.26
- Cite (ACL):
- Stefan Grünewald and Annemarie Friedrich. 2020. RobertNLP at the IWPT 2020 Shared Task: Surprisingly Simple Enhanced UD Parsing for English. In Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, pages 245–252, Online. Association for Computational Linguistics.
- Cite (Informal):
- RobertNLP at the IWPT 2020 Shared Task: Surprisingly Simple Enhanced UD Parsing for English (Grünewald & Friedrich, IWPT 2020)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/2020.iwpt-1.26.pdf