In this paper, we are only concerned with grammars that define proper probability distributions over trees, such that the probability of all derivations sum up to 1 and no probability mass gets lost in derivations that never reach a terminal yield.
we require (if t(d) is the tree derived by derivation d): For simplicity, but without loss of generality, we assume there are no recursions on the start symbol.