It also improves over the baseline cube-pruning parser without max-violation update strategies (<cite>Zhang and McDonald, 2012</cite>) , showing the importance of update strategies in inexact hypergraph search.