Guiding Non-Autoregressive Neural Machine Translation Decoding with Reordering Information
Qiu Ran, Yankai Lin, Peng Li, Jie Zhou
TL;DR
This work tackles the persistent quality gap between non-autoregressive NMT and autoregressive models by introducing ReorderNAT, a framework that explicitly models target-side reordering through a dedicated reordering module that generates a pseudo-translation. The decoder then translates conditioned on this pseudo-translation, using either deterministic or non-deterministic guiding strategies to narrow the decoding search space and better capture target dependencies. Empirical results across multiple language pairs demonstrate consistent improvements over existing NAT approaches and substantial speedups, with particularly strong gains when word order differs, such as in Chinese–English. The study shows that reordering-informed NAT can approach autoregressive performance while preserving much of NAT’s speed advantages, offering a practical path toward efficient, high-quality MT systems.
Abstract
Non-autoregressive neural machine translation (NAT) generates each target word in parallel and has achieved promising inference acceleration. However, existing NAT models still have a big gap in translation quality compared to autoregressive neural machine translation models due to the enormous decoding space. To address this problem, we propose a novel NAT framework named ReorderNAT which explicitly models the reordering information in the decoding procedure. We further introduce deterministic and non-deterministic decoding strategies that utilize reordering information to narrow the decoding search space in our proposed ReorderNAT. Experimental results on various widely-used datasets show that our proposed model achieves better performance compared to existing NAT models, and even achieves comparable translation quality as autoregressive translation models with a significant speedup.
