Cube Pruning as Heuristic Search
نویسندگان
چکیده
Cube pruning is a fast inexact method for generating the items of a beam decoder. In this paper, we show that cube pruning is essentially equivalent to A* search on a specific search space with specific heuristics. We use this insight to develop faster and exact variants of cube pruning.
منابع مشابه
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.
متن کاملFaster cube pruning
Cube Pruning is a fast method to explore the search space of a beam decoder. In this paper we present two modifications of the algorithm that aim to improve the speed and reduce the amount of memory needed at execution time. We show that, in applications where Cube Pruning is applied to a monotonic search space, the proposed algorithms retrieve the same K-best set with lower complexity. When te...
متن کاملMultiway Pruning for Efficient Iceberg Cubing
Effective pruning is essential for efficient iceberg cube computation. Previous studies have focused on exclusive pruning: regions of a search space that do not satisfy some condition are excluded from computation. In this paper we propose inclusive and anti-pruning. With inclusive pruning, necessary conditions that solutions must satisfy are identified and regions that can not be reached by su...
متن کاملExtending Hiero Decoding in Moses with Cube Growing
Hierarchical phrase-based (Hiero) models have richer expressiveness than phrase-based models and have shown promising translation quality gains for many language pairs whose syntactic divergences, such as reordering, could be better captured. However, their expressiveness comes at a high computational cost in decoding, which is induced by huge dynamic programs associated with language model int...
متن کاملRecent Progress in the Design and Analysis of Admissible Heuristic Functions
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik’s Cube, with over 10 19 states, and the 5 5 sliding-tile puzzle, with almost 10 states, have been solved optimally. This progress is not the result of better search algorithms, but more effective heuristic evaluation functions. In ad...
متن کامل