SOTAVerified

A Transition-based System for Universal Dependency Parsing

2017-08-01CONLL 2017Unverified0· sign in to hype

Hao Wang, Hai Zhao, Zhisong Zhang

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

This paper describes the system for our participation in the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. In this work, we design a system based on UDPipe1 for universal dependency parsing, where multilingual transition-based models are trained for different treebanks. Our system directly takes raw texts as input, performing several intermediate steps like tokenizing and tagging, and finally generates the corresponding dependency trees. For the special surprise languages for this task, we adopt a delexicalized strategy and predict basing on transfer learning from other related languages. In the final evaluation of the shared task, our system achieves a result of 66.53\% in macro-averaged LAS F1-score.

Tasks

Reproductions