SOTAVerified

Multilingual Back-and-Forth Conversion between Content and Function Head for Easy Dependency Parsing

2017-04-01EACL 2017Code Available0· sign in to hype

Ryosuke Kohita, Hiroshi Noji, Yuji Matsumoto

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Universal Dependencies (UD) is becoming a standard annotation scheme cross-linguistically, but it is argued that this scheme centering on content words is harder to parse than the conventional one centering on function words. To improve the parsability of UD, we propose a back-and-forth conversion algorithm, in which we preprocess the training treebank to increase parsability, and reconvert the parser outputs to follow the UD scheme as a postprocess. We show that this technique consistently improves LAS across languages even with a state-of-the-art parser, in particular on core dependency arcs such as nominal modifier. We also provide an in-depth analysis to understand why our method increases parsability.

Tasks

Reproductions