Because of their efficiency and ease of implementation, transition-based parsers are the most common systems for dependency parsing.
efficiency comes at a price, namely a loss in expressivity: while graph-based parsers are able to produce any tree spanning the input sentence, many transition-based systems are restricted to projective trees.