This replicates the situation in a non-incremental, top-down TAG derivation, in which the verification tree would have been directly integrated with u predict without the intermediate prediction step.
we factorize the bilexical probability as follows: In order to calculate the probability of a derived tree using this probability model, each node is visited twice during the derivation, once from the left side and once from the right side.