G 0 assumes the empty source sentence consists only of a single wall node.
every word generated under G 0 aligns to null, and we can simplify the dynamic programming algorithm that scores a tree τ s under G 0 : where the final product is 1 when t i has no children.