In this section, we first describe an algorithm that attaches function words to a packed forest guided by target chunk information.
given a triple ⟨F S , T, A⟩, namely an aligned (A) source forest (F S ) to target sentence (T ) pair, we 1) tailor the alignment A by removing the alignments for target function words, 2) seek attachable nodes in the source forest F S for each function word, and 3) construct a derivation forest by topologically travers-ing F S .