For We split L 1 into (possibly empty) sublists σ i , 0 ≤ i < s, called segments, such that each σ i is the descending sublist consisting of all elements from L 1 that belong to I i .
empirically, we show a gain in running time of a standard machine translation system, at a small loss in accuracy.