End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Autoregressive decoding is the only part of sequence-to-sequence models that prevents them from massive parallelization at inference time.Non-autoregressive models enable the decoder to generate all output symbols independently in parallel.We present a novel nonautoregressive architecture based on connectionist temporal classification and evaluate it on the task of neural machine translation.Unlike other non-autoregressive methods which operate in several steps, our model can be trained end-to-end.We conduct experiments on the WMT English-Romanian and English-German datasets.Our models achieve a significant speedup over the autoregressive models, keeping the translation quality comparable to other non-autoregressive models.
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.
Integrity signals
Registry
Cites
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.
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
BLEU: a method for automatic evaluation of machine translation
Papineni, K., Roukos, S., Ward, T., & Zhu, W.-J. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073135 · Cited by 21,344
Graves, A., Fernández, S., Gomez, F., & Schmidhuber, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143891 · Cited by 5,370
Findings of the 2016 Conference on Machine Translation
Bojar, O., Chatterjee, R., Federmann, C., Graham, Y., Haddow, B., Huck, M., Jimeno Yepes, A., Koehn, P., Logacheva, V., Monz, C., et al. (2016) · Proceedings of the First Conference on Machine Translation: Volume 2, Shared Task Papers · doi:10.18653/v1/w16-2301 · Cited by 539 · cited 1×
“For English-Romanian experiments, we used the WMT16 (Bojar et al., 2016) news dataset.”
MethodDeterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement
Lee, J., Mansimov, E., & Cho, K. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1149 · Cited by 386 · cited 3×
“Lee et al. (2018) propose an architecture with two decoders.”
MethodA Systematic Comparison of Smoothing Techniques for Sentence-Level BLEU
Chen, B., & Cherry, C. (2014) · Proceedings of the Ninth Workshop on Statistical Machine Translation · doi:10.3115/v1/w14-3346 · Cited by 191 · cited 1×
“We also evaluated the translations using sentence-level BLEU score (Chen and Cherry, 2014) and measure the Pearson correlation with the length of the source sentence and the number of null symbols generated in the output.”
Method
Cited by
Mask-Predict: Parallel Decoding of Conditional Masked Language Models
Ghazvininejad, M., Levy, O., Liu, Y., & Zettlemoyer, L. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1633 · Cited by 464
Neural Machine Translation: A Review
Stahlberg, F. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12007 · Cited by 397
Glancing Transformer for Non-Autoregressive Neural Machine Translation
Qian, L., Zhou, H., Bao, Y., Wang, M., Qiu, L., Zhang, W., Yu, Y., & Li, L. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.155 · Cited by 108
“…2019), our vanilla NAT-base model, the NAT imitating the autoregressive model imitateNAT (Wei et al., 2019) and the Flow-based NAT model Flowseq (Ma et al., 2019), and the NAT with CRF (Lafferty et al., 2001) decoding NAT-DCRF (Sun et al., 2019), and the NAT with iterative refinement:…”
MethodInfluentialErdem, E., Kuyu, M., Yagcioglu, S., Frank, A., Parcalabescu, L., Plank, B., Babii, A., Turuta, O., Erdem, A., Calixto, I., et al. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12918 · Cited by 54
“…computes log p(yk|x1:M ), and further iterations refine the previous predictions log p(yk|x1:M , ŷ1:N ) (Gu, Bradbury, Xiong, Li, & Socher, 2018; Libovický & Helcl, 2018; Kaiser, Bengio, Roy, Vaswani, Parmar, Uszkoreit, & Shazeer, 2018; Lee, Mansimov, & Cho, 2018; Zhou, Gu, & Neubig, 2020).”
Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation
Xia, H., Ge, T., Wang, P., Chen, S.-Q., Wei, F., & Sui, Z. (2023) · Findings of the Association for Computational Linguistics: EMNLP 2023 · doi:10.18653/v1/2023.findings-emnlp.257 · Cited by 40
“Recently, various attempts have been made to improve the performance of NAR models, including training with alignment-based objectives (Libovický and Helcl, 2018; Ghazvininejad et al., 2020; Saharia et al., 2020; Gu and Kong, 2021; Shao and Feng, 2022), modeling dependencies between target to-kens…”
Background
Metadata
- Authors
- Libovický, J., & Helcl, J.
- Venue
- Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing
- Published
- 2018
- Pages
- 3016-3021
- OpenAlex
- W2892213699
- Cited by
- 124
- References
- 5
- FWCI
- 6.55
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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: End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification. https://app.cochat.ai/papers/10.18653/v1/d18-1336
- The paper
- Libovický, J., & Helcl, J. (2018). End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classification. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/d18-1336
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.