SOTAVerified

Non-Projective Dependency Parsing with Non-Local Transitions

2018-06-01NAACL 2018Unverified0· sign in to hype

Daniel Fern{\'a}ndez-Gonz{\'a}lez, Carlos G{\'o}mez-Rodr{\'\i}guez

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

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-Arcs 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 parsers.

Tasks

Reproductions