Abstract
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. © 2009 ACL and AFNLP.
Cite
CITATION STYLE
Hopkins, M., & Langmead, G. (2009). Cube pruning as heuristic search. In EMNLP 2009 - Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: A Meeting of SIGDAT, a Special Interest Group of ACL, Held in Conjunction with ACL-IJCNLP 2009 (pp. 62–71). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1699510.1699519
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
