Stanford's Graph-based Neural Dependency Parser at the CoNLL 2017 Shared Task
This paper describes the neural dependency parser submitted by Stanford to the CoNLL 2017 Shared Task on parsing Universal Dependencies. Our system uses relatively simple LSTM networks to produce part of speech tags and labeled dependency parses from segmented and tokenized sequences of words. In order to address the rare word problem that abounds in languages with complex morphology, we include a character-based word representation that uses an LSTM to produce embeddings from sequences of characters. Our system was ranked first according to all five relevant metrics for the system: UPOS tagging (93.09{\%}), XPOS tagging (82.27{\%}), unlabeled attachment score (81.30{\%}), labeled attachment score (76.30{\%}), and content word labeled attachment score (72.57{\%}).
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
AntNLP at CoNLL 2018 Shared Task: A Graph-Based Parser for Universal Dependency Parsing
We describe the graph-based dependency parser in our system (AntNLP) submitted to the CoNLL 2018 UD Shared Task. We use bidirectional lstm to get the word representation, then a bi-affine pointer networks to compute scor…
Dependency ParsingCLCL (Geneva) DINN Parser: a Neural Network Dependency Parser Ten Years Later
This paper describes the University of Geneva{'}s submission to the CoNLL 2017 shared task Multilingual Parsing from Raw Text to Universal Dependencies (listed as the CLCL (Geneva) entry). Our submitted parsing system is…
Dependency ParsingFeature EngineeringWord EmbeddingsUParse: the Edinburgh system for the CoNLL 2017 UD shared task
This paper presents our submissions for the CoNLL 2017 UD Shared Task. Our parser, called UParse, is based on a neural network graph-based dependency parser. The parser uses features from a bidirectional LSTM to to produ…
Dependency ParsingMachine TranslationQuestion AnsweringSentence+1Parsing Any Domain English text to CoNLL dependencies
It is well known that accuracies of statistical parsers trained over Penn Treebank on test sets drawn from the same corpus tend to be overestimates of their actual parsing performance. This gives rise to the need for eva…
BenchmarkingDependency ParsingMachine TranslationQuestion Answering+2The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms
We developed two simple systems for dependency parsing: darc, a transition-based parser, and mstnn, a graph-based parser. We tested our systems in the CoNLL 2017 UD Shared Task, with darc being the official system. Darc …
Dependency Parsing