How Much of Enhanced UD Is Contained in UD?

Adam Ek, Jean-Philippe Bernardy


Abstract
In this paper, we present the submission of team CLASP to the IWPT 2020 Shared Task on parsing enhanced universal dependencies. We develop a tree-to-graph transformation algorithm based on dependency patterns. This algorithm can transform gold UD trees to EUD graphs with an ELAS score of 81.55 and a EULAS score of 96.70. These results show that much of the information needed to construct EUD graphs from UD trees are present in the UD trees. Coupled with a standard UD parser, the method applies to the official test data and yields and ELAS score of 67.85 and a EULAS score is 80.18.
Anthology ID:
2020.iwpt-1.23
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:
221–226
Language:
URL:
https://aclanthology.org/2020.iwpt-1.23
DOI:
10.18653/v1/2020.iwpt-1.23
Bibkey:
Cite (ACL):
Adam Ek and Jean-Philippe Bernardy. 2020. How Much of Enhanced UD Is Contained in UD?. In Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, pages 221–226, Online. Association for Computational Linguistics.
Cite (Informal):
How Much of Enhanced UD Is Contained in UD? (Ek & Bernardy, IWPT 2020)
Copy Citation:
PDF:
https://aclanthology.org/2020.iwpt-1.23.pdf
Video:
 http://slideslive.com/38929690