Following a common approach to structured prediction problems, the score of a tree y is defined as a sum of local scores.
s , where E ranges over small connected subgraphs of y that can be scored individually.