CoChat

Fully Non-autoregressive Neural Machine Translation: Tricks of the Trade

Open access
Gu, Jiatao, Kong, Xiang · 2021 · Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021
Cited by 80

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Fully non-autoregressive neural machine translation (NAT) simultaneously predicts tokens with single forward of neural networks, which significantly reduces the inference latency at the expense of quality drop compared to the Transformer baseline.In this work, we target on closing the performance gap while maintaining the latency advantage.We first inspect the fundamental issues of fully NAT models, and adopt dependency reduction in the learning space of output tokens as the primary guidance.Then, we revisit methods in four different aspects that have been proven effective for improving NAT models, and carefully combine these techniques with necessary modifications.Our extensive experiments on three translation benchmarks show that the proposed system achieves the state-of-the-art results for fully NAT models, and obtains comparable performance with the autoregressive and iterative NAT systems.For instance, one of the proposed models achieves 27.49BLEU points on WMT14 En-De with 16.5× speed-up compared to similar sized autoregressive baseline under the same inference condition.The implementation of our model is available here 1 .

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2021.findings-acl.11

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 80

Metadata

Authors
Gu, J., & Kong, X.
Venue
Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021
Published
2021
Pages
120-133
OpenAlex
W3177172118
Cited by
80
References
8
FWCI
8.64
Type
conference paper
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fully Non-autoregressive Neural Machine Translation: Tricks of the Trade. https://app.cochat.ai/papers/10.18653/v1/2021.findings-acl.11
The paper
Gu, J., & Kong, X. (2021). Fully Non-autoregressive Neural Machine Translation: Tricks of the Trade. Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. https://doi.org/10.18653/v1/2021.findings-acl.11

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.