Non-Projective Dependency Parsing with Non-Local Transitions

We present a novel transition system, based on the Covington non-projective parser, introducing non-local transitions that can directly create arcs involving nodes to the left of the current focus positions. This avoids the need for long sequences of No-Arc transitions to create long-distance arcs, thus alleviating error propagation. The resulting parser outperforms the original version and achieves the best accuracy on the Stanford Dependencies conversion of the Penn Treebank among greedy transition-based algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2018

Global Transition-based Non-projective Dependency Parsing

Shi, Huang, and Lee (2017) obtained state-of-the-art results for English...
research
04/21/2018

Faster Shift-Reduce Constituent Parsing with a Non-Binary, Bottom-Up Strategy

We propose a novel non-binary shift-reduce algorithm for constituent par...
research
05/12/2017

Arc-swift: A Novel Transition System for Dependency Parsing

Transition-based dependency parsers often need sequences of local shift ...
research
04/22/2016

Dependency Parsing with LSTMs: An Empirical Evaluation

We propose a transition-based dependency parser using Recurrent Neural N...
research
05/23/2018

A Transition-based Algorithm for Unrestricted AMR Parsing

Non-projective parsing can be useful to handle cycles and reentrancy in ...
research
02/22/2017

Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing

Error propagation is a common problem in NLP. Reinforcement learning exp...
research
06/03/2019

Phase-based Minimalist Parsing and complexity in non-local dependencies

A cognitively plausible parsing algorithm should perform like the human ...

Please sign up or login with your details

Forgot password? Click here to reset