Their greedy algorithm breaks the parsing into a sequence of local steps, which correspond to choosing the head for each modifier word (one arc at a time) in the bottom-up order relative to the current tree.
we employed the global inference algorithm to change the entire tree (all at a time) in each refinement step, which makes the improvement more efficient.