We remove such words to produce dependency trees that are close in syntax to the target language.
we accumulate the probabilities of p(e i |f j ) for the source word e i who has no aligned target word: where we traverse all target words to sum their alignment probabilities with e i .