The benefit of transition-based parsing is the use of greedy algorithms which have a linear time complexity.
due to the greedy algorithms, longer arc parses can cause error propagation across each transition (Kübler et al., 2009).