Heuristic Cube Pruning in Linear Time

Andrea Gesmundo, Giorgio Satta, James Henderson

Abstract: We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation system, at a small loss in accuracy.