mlsanityData to 14 Oct 2026

Speeding Up Neural Machine Translation Decoding by Cube Pruning

arXiv 1809.02992 ↗First posted 9 Sep 2018cs.CL cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Although neural machine translation has achieved promising results, it suffers from slow translation speed. The direct consequence is that a trade-off has to be made between translation quality and speed, thus its performance can not come into full play. We apply cube pruning, a popular technique to speed up dynamic programming, into neural machine translation to speed up the translation. To construct the equivalence class, similar target hidden states are combined, leading to less RNN expansion operations on the target side and less softmax operations over the large target vocabulary. The experiments show that, at the same or even better translation quality, our method can translate faster compared with naive beam search by 3.3× on GPUs and 3.5× on CPUs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Sep 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.