Considering the large search space of possible programs, an alignment model that takes into account the full range of correspondences between program operations and question spans would be very expensive.
we instead optimize the following objective: where E[A] are the marginals of A with respect to p (A|x, t, h).