Here we follow the arc factored method and define the score of a dependency tree as the sum of the scores of all the arcs in the tree.
the optimal dependency tree for T is a spanning tree with the highest score and obtained through the function DT(T,w): ) denotes the score of the arc <e i , r, e j > which is calculated according to its feature representation f(e i ,r,e j ) and a weight vector w. Next, two basic problems need to be solved: how to find the dependency tree with the highest score for T given all the arc scores (i.e.