Graph Rewriting for Enhanced Universal Dependencies

Bruno Guillaume, Guy Perrier


Abstract
This paper describes a system proposed for the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies (EUD). We propose a Graph Rewriting based system for computing Enhanced Universal Dependencies, given the Basic Universal Dependencies (UD).
Anthology ID:
2021.iwpt-1.18
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:
175–183
Language:
URL:
https://aclanthology.org/2021.iwpt-1.18
DOI:
10.18653/v1/2021.iwpt-1.18
Bibkey:
Cite (ACL):
Bruno Guillaume and Guy Perrier. 2021. Graph Rewriting for Enhanced Universal Dependencies. In Proceedings of the 17th International Conference on Parsing Technologies and the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies (IWPT 2021), pages 175–183, Online. Association for Computational Linguistics.
Cite (Informal):
Graph Rewriting for Enhanced Universal Dependencies (Guillaume & Perrier, IWPT 2021)
Copy Citation:
PDF:
https://aclanthology.org/2021.iwpt-1.18.pdf