SUD or Surface-Syntactic Universal Dependencies: An annotation scheme near-isomorphic to UD

Kim Gerdes, Bruno Guillaume, Sylvain Kahane, Guy Perrier


Abstract
This article proposes a surface-syntactic annotation scheme called SUD that is near-isomorphic to the Universal Dependencies (UD) annotation scheme while following distributional criteria for defining the dependency tree structure and the naming of the syntactic functions. Rule-based graph transformation grammars allow for a bi-directional transformation of UD into SUD. The back-and-forth transformation can serve as an error-mining tool to assure the intra-language and inter-language coherence of the UD treebanks.
Anthology ID:
W18-6008
Volume:
Proceedings of the Second Workshop on Universal Dependencies (UDW 2018)
Month:
November
Year:
2018
Address:
Brussels, Belgium
Venues:
EMNLP | UDW | WS
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
66–74
Language:
URL:
https://aclanthology.org/W18-6008
DOI:
10.18653/v1/W18-6008
Bibkey:
Cite (ACL):
Kim Gerdes, Bruno Guillaume, Sylvain Kahane, and Guy Perrier. 2018. SUD or Surface-Syntactic Universal Dependencies: An annotation scheme near-isomorphic to UD. In Proceedings of the Second Workshop on Universal Dependencies (UDW 2018), pages 66–74, Brussels, Belgium. Association for Computational Linguistics.
Cite (Informal):
SUD or Surface-Syntactic Universal Dependencies: An annotation scheme near-isomorphic to UD (Gerdes et al., 2018)
Copy Citation:
PDF:
https://aclanthology.org/W18-6008.pdf