作者: Joakim Nivre , Yoav Goldberg
DOI:
关键词: Parsing 、 Algorithm 、 Oracle 、 Parser combinator 、 Sentence 、 LR parser 、 Tree (data structure) 、 Computer science 、 Set (abstract data type) 、 Theoretical computer science 、 Dependency grammar 、 Computational linguistics 、 Transition system
摘要: The standard training regime for transition-based dependency parsers makes use of an oracle, which predicts optimal transition sequence a sentence and its gold tree. We present improved oracle the arc-eager system, provides set transitions every valid parser configuration, including configurations from tree is not reachable. In such cases, that will lead to best reachable given configuration. efficient implement provably correct. train deterministic left-to-right less sensitive error propagation, using online procedure also explores resulting non-optimal sequences transitions. This new outperforms greedy trained conventional oracles on range data sets, with average improvement over 1.2 LAS points up almost 3 some sets.