Paper: Heuristic Cube Pruning in Linear Time

ACL ID P12-2058
Title Heuristic Cube Pruning in Linear Time
Venue Annual Meeting of the Association of Computational Linguistics
Session Short Paper
Year 2012
Authors

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.