In this paper, our focus is the search problem that arises at training time when training from denotations, i.e., finding programs that execute to the right denotation.
we would like to focus on scenarios where programs are long, and standard beam search fails.