It is their success that motivates building explicitly trained, linear-time pruning models.
while a greedy solution for arc-standard transition-based parsers can be computed in linear-time, Kuhlmann et al.