A Polynomial-Time Dynamic Oracle for Non-Projective Dependency Parsing
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingSimilar Papers 제목 키워드 기반
Exploiting Dynamic Oracles to Train Projective Dependency Parsers on Non-Projective Trees
Because the most common transition systems are projective, training a transition-based dependency parser often implies to either ignore or rewrite the non-projective training examples, which has an adverse impact on accu…
Dependency ParsingGlobal Greedy Dependency Parsing
Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacki…
ARCDependency ParsingRe-RankingSentenceCalculating 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 ParsingCalculating the optimal step of arc-eager parsing for non-projective trees
It is shown that the optimal next step of an arc-eager parser relative to a non-projective dependency structure can be calculated in cubic time, solving an open problem in parsing theory. Applications are in training of …
ARCArc-Hybrid Non-Projective Dependency Parsing with a Static-Dynamic Oracle
In this paper, we extend the arc-hybrid system for transition-based parsing with a swap transition that enables reordering of the words and construction of non-projective trees. Although this extension breaks the arc-dec…
ARCDependency Parsing