The probability of a parse tree T is the sum of the probabilities of its distinct derivations.
let t id be the i-th subtree in the derivation d that produces tree T, then the probability of T is given by DOP1 considers counts of subtrees of a wide range of sizes: everything from counts of singlelevel rules to entire trees is taken into account to compute the most probable parse tree of a sentence.