Heuristic Cube Pruning in Linear Time

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.

• Type: Journal
• Year: 2012
• Where: ACL
• Authors: Andrea Gesmundo, Giorgio Satta, James Henderson
• Keywords: ACL 2012, Beam Size, Computational Linguistics, Linear Time, Machine Translation System