Then, there are a total of Y × Z parses, and the probability of each parse is P(x)P(y)P(z), where y ∈ Y and z ∈ Z.
to compute h Y,Z,k , we need to sum over all possible parses: the tree entropy of the entire sentence can be recursively computed from the entropy values of the substrings.