We want to construct an MBOT M such that M (t, u) = M (t, u) • G(t) for every t ∈ T Σ and u ∈ T ∆ .
each input tree should be rescored according to G; in the unweighted case this yields that the translation of M is filtered to the set of input trees accepted by G. We occasionally write the pair (a, b) in angled parentheses (' ' and ' ').