Biaffine Dependency and Semantic Graph Parsing for EnhancedUniversal Dependencies

Giuseppe Attardi, Daniele Sartiano, Maria Simi


Abstract
This paper presents the system used in our submission to the IWPT 2021 Shared Task. This year the official evaluation metrics was ELAS, therefore dependency parsing might have been avoided as well as other pipeline stages like POS tagging and lemmatization. We nevertheless chose to deploy a combination of a dependency parser and a graph parser. The dependency parser is a biaffine parser, that uses transformers for representing input sentences, with no other feature. The graph parser is a semantic parser that exploits a similar architecture except for using a sigmoid crossentropy loss function to return multiple values for the predicted arcs. The final output is obtained by merging the output of the two parsers. The dependency parser achieves top or close to top LAS performance with respect to other systems that report results on such metrics, except on low resource languages (Tamil, Estonian, Latvian).
Anthology ID:
2021.iwpt-1.19
Volume:
Proceedings of the 17th International Conference on Parsing Technologies and the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies (IWPT 2021)
Month:
August
Year:
2021
Address:
Online
Venues:
ACL | IJCNLP | IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
184–188
Language:
URL:
https://aclanthology.org/2021.iwpt-1.19
DOI:
10.18653/v1/2021.iwpt-1.19
Bibkey:
Copy Citation:
PDF:
https://aclanthology.org/2021.iwpt-1.19.pdf