Our model allows both the source and target phrases of an initial rule with adjoining sites to be discontinuous, which goes beyond the expressive power of synchronous CFG and TSG.
we divide forest rescoring for STAG into three steps: 1. matching, matching STAG rules against the input tree to obtain a TAG derivation forest; 2. conversion, converting the TAG derivation forest into a translation forest; 3. intersection, intersecting the translation forest with an n-gram language model.