We improve the dependency tree y via a similar hill-climbing process.
we greedily update the head y i,j of each morpheme in a bottom-up order as follows where Y i,j is the set of candidate heads such that changing y i,j to any candidate does not violate the tree constraint.