pith. sign in

arxiv: 1703.04929 · v1 · pith:JDMGBRICnew · submitted 2017-03-15 · 💻 cs.CL

SyntaxNet Models for the CoNLL 2017 Shared Task

classification 💻 cs.CL
keywords systemmodelsparsingsharedtasktreebanksabsoluteaccuracy
0
0 comments X
read the original abstract

We describe a baseline dependency parsing system for the CoNLL2017 Shared Task. This system, which we call "ParseySaurus," uses the DRAGNN framework [Kong et al, 2017] to combine transition-based recurrent parsing and tagging with character-based word representations. On the v1.3 Universal Dependencies Treebanks, the new system outpeforms the publicly available, state-of-the-art "Parsey's Cousins" models by 3.47% absolute Labeled Accuracy Score (LAS) across 52 treebanks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.