If we choose an incoming hyperedge according to the probability P t (τ(z)) of the resulting tree, holding all other variable assignments fixed, we see that, because P t is uniform, we will choose with uniform probability of 1/m among the m incoming hyperedges at each node.
the size of the grammar taken from the single sample (100th sample) is only about 9% of the baseline but still produces translation results that are not far worse than the baseline.