The parser's goal is then to find the most preferred parse; that is, a projective tree, Y ∈ Φ (X), that obtains the highest "score".
one would assume that the score of a complete spanning tree Y for a given sentence, whether probabilistically motivated or not, can be decomposed as a sum of local scores for each link (a word pair) (Eisner, 1996;Eisner and Satta, 1999;McDonald et al., 2005a).