Abstract: Beam search is the popular decoding algorithm for phrase-based statistical machine translation systems. This paper describes another improved algorithm to beam search algorithm based on cube pruning algorithm-reverse recursive algorithm based on cube pruning. Beam search expands all the possible hypothesis on the stack. Cube pruning only expands the top k best hypothesis and reverse recursive algorithm based on cube pruning just expands the hypothesis scoring high. The results show that cubepruning algorithm use less time to achieve the same translation quality and reverse recursive algorithm based on cube pruning is quicker than cube pruning without affecting the translation quality much.