{"paper":{"title":"SyntaxNet Models for the CoNLL 2017 Shared Task","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chayut Thanapirom, Chris Alberti, Dan Gillick, Daniel Andor, David Weiss, Ivan Bogatyy, Ji Ma, Lingpeng Kong, Mark Omernick, Michael Collins, Slav Petrov, Terry Koo, Zora Tung","submitted_at":"2017-03-15T04:57:17Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04929","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}