Greedy one-best parsing

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 …...