A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing
We propose an efficient dynamic oracle for training the 2-Planar transition-based parser, a linear-time parser with over 99{\%} coverage on non-projective syntactic corpora. This novel approach outperforms the static training strategy in the vast majority of languages tested and scored better on most datasets than the arc-hybrid parser enhanced with the Swap transition, which can handle unrestricted non-projectivity.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCDependency ParsingSimilar Papers 제목 키워드 기반
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing
We propose an efficient dynamic oracle for training the 2-Planar transition-based parser, a linear-time parser with over 99% coverage on non-projective syntactic corpora. This novel approach outperforms the static traini…
ARCDependency ParsingThe expected sum of edge lengths in planar linearizations of trees. Theory and applications
Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. Th…
SentenceCalculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time
We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as dynamic oracle. Unlike existing algorithms, it is applicable …
Dependency ParsingA Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing
Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed st…
Constituency ParsingDependency ParsingRerankingSentence