The document-level pre-filtering reduces the overall processing time by about 40 % (from 4 to 2.5 days on a 100-CPU cluster).
the search is initialized by adding a single hypothesis for each target sentence t m ∈ Θ to the stack for j = 1: During the left-to-right search , state transitions of the following type occur: where the partial score is updated as: Here, f (1, j, i) is a partial feature vector computed for all the additional source and target positions processed in the last extension step.