The scoring function is a linear model f (x, y) = θ Φ(x, y, z) and is trained with an early update structured perceptron to match both a given order and syntactic tree.
let Z represent all projective dependency parse trees over M words.