In the basic model, P(B) is uniform over binary trees.
then, for each i, j , the subspan and context pair is generated via a classconditional independence model: all spans guess their sequences and contexts given only a constituency decision b.