Transition-Based Dependency Parser

We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. …...

Transition-based dependency parsers are often forced to make attachment deci- sions at a point when only partial infor- mation about the relevant graph configu- ration is available. In this paper, …...

Transition-based dependency parsers usu- ally use transition systems that monotoni- cally extend partial parse states until they identify a complete parse tree. Honni- bal et al. (2013) showed that greedy …...