Given a dependency graph G = (s, A), for a sentence s = w 1 , ..., w n , the revised tree is R(G) = (s, A ), where each dependency a i is equal to F (a i ).
the head in a i has been changed, or not, according to the rule predicted by the classifier.