Much of the recent work on dependency parsing has been focused on solving inherent combinatorial problems associated with rich scoring functions.
we demonstrate that highly expressive scoring functions can be used with substantially simpler inference procedures.