Given a sentence s and its parse tree τ s , we formulate the translation problem as finding the target sentence t * (along with its parse tree τ * t and alignment a * to the source tree) such that 3 In order to include overlapping features and permit hidden variables during training, we use a single globally-normalized conditional log-linear model.
where the g are arbitrary feature functions and the θ are feature weights.