{"url":"/sota/machine-translation-on-wmt2016-english-1","task":{"name":"Machine Translation","url":"/task/machine-translation","note":null},"dataset":{"name":"WMT2016 English-Romanian","url":"/dataset/wmt-2016"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"**Machine translation** is the task of translating a sentence in a source language to a different target language.\r\n\r\nApproaches for machine translation can range from rule-based to statistical to neural-based. More recently, encoder-decoder attention-based architectures like BERT have attained major improvements in machine translation. \r\n\r\nOne of the most popular datasets used to benchmark machine translation systems is the WMT family of datasets. Some of the most commonly used evaluation metrics for machine translation systems include BLEU, METEOR, NIST, and others. \r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Google seq2seq](https://github.com/google/seq2seq) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["BLEU score","BLEU-4"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"BLEU score":"higher","BLEU-4":"higher"}},"counts":{"rows":21,"rows_with_code":20,"rows_with_paper_page":21,"rows_dated":21,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"DeLighT","metrics":{"BLEU score":"34.7"},"uses_additional_data":false,"paper_date":"2020-08-03","paper":"/paper/delight-very-deep-and-light-weight","paper_url":"https://arxiv.org/abs/2008.00623v2","paper_title":"DeLighT: Deep and Light-weight Transformer","code":"https://github.com/sacmehta/delight","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":3,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"CMLM+LAT+4 iterations","metrics":{"BLEU score":"32.87"},"uses_additional_data":false,"paper_date":"2020-11-12","paper":"/paper/incorporating-a-local-translation-mechanism","paper_url":"https://arxiv.org/abs/2011.06132v1","paper_title":"Incorporating a Local Translation Mechanism into Non-autoregressive Translation","code":"https://github.com/shawnkx/NAT-with-Local-AT","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":3,"model":"FlowSeq-large (NPD n = 30)","metrics":{"BLEU score":"32.35"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/flowseq-non-autoregressive-conditional","paper_url":"https://arxiv.org/abs/1909.02480v3","paper_title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","code":"https://github.com/XuezheMax/flowseq","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"FlowSeq-large (NPD n=15)","metrics":{"BLEU score":"31.97"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/flowseq-non-autoregressive-conditional","paper_url":"https://arxiv.org/abs/1909.02480v3","paper_title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","code":"https://github.com/XuezheMax/flowseq","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"FlowSeq-large (IWD n = 15)","metrics":{"BLEU score":"31.08"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/flowseq-non-autoregressive-conditional","paper_url":"https://arxiv.org/abs/1909.02480v3","paper_title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","code":"https://github.com/XuezheMax/flowseq","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":6,"model":"CMLM+LAT+1 iterations","metrics":{"BLEU score":"30.74"},"uses_additional_data":false,"paper_date":"2020-11-12","paper":"/paper/incorporating-a-local-translation-mechanism","paper_url":"https://arxiv.org/abs/2011.06132v1","paper_title":"Incorporating a Local Translation Mechanism into Non-autoregressive Translation","code":"https://github.com/shawnkx/NAT-with-Local-AT","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"ConvS2S BPE40k","metrics":{"BLEU score":"29.9"},"uses_additional_data":false,"paper_date":"2017-05-08","paper":"/paper/convolutional-sequence-to-sequence-learning","paper_url":"http://arxiv.org/abs/1705.03122v3","paper_title":"Convolutional Sequence to Sequence Learning","code":"https://github.com/facebookresearch/fairseq","n_code_links":37,"syntology":null},{"rank_in_archive_order":8,"model":"FlowSeq-large","metrics":{"BLEU score":"29.86"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/flowseq-non-autoregressive-conditional","paper_url":"https://arxiv.org/abs/1909.02480v3","paper_title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","code":"https://github.com/XuezheMax/flowseq","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"NAT +FT + NPD","metrics":{"BLEU score":"29.79"},"uses_additional_data":false,"paper_date":"2017-11-07","paper":"/paper/non-autoregressive-neural-machine-translation-1","paper_url":"http://arxiv.org/abs/1711.02281v2","paper_title":"Non-Autoregressive Neural Machine Translation","code":"https://github.com/salesforce/nonauto-nmt","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":10,"model":"Denoising autoencoders (non-autoregressive)","metrics":{"BLEU score":"29.66"},"uses_additional_data":false,"paper_date":"2018-02-19","paper":"/paper/deterministic-non-autoregressive-neural","paper_url":"http://arxiv.org/abs/1802.06901v3","paper_title":"Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement","code":"https://github.com/nyu-dl/dl4mt-nonauto","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":1}},{"rank_in_archive_order":11,"model":"FlowSeq-base","metrics":{"BLEU score":"29.26"},"uses_additional_data":false,"paper_date":"2019-09-05","paper":"/paper/flowseq-non-autoregressive-conditional","paper_url":"https://arxiv.org/abs/1909.02480v3","paper_title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","code":"https://github.com/XuezheMax/flowseq","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"GRU BPE90k","metrics":{"BLEU score":"28.9"},"uses_additional_data":false,"paper_date":"2016-08-01","paper":"/paper/the-qt21himl-combined-machine-translation","paper_url":"https://aclanthology.org/W16-2320","paper_title":"The QT21/HimL Combined Machine Translation System","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":13,"model":"BiGRU","metrics":{"BLEU score":"28.1"},"uses_additional_data":false,"paper_date":"2016-06-09","paper":"/paper/edinburgh-neural-machine-translation-systems","paper_url":"http://arxiv.org/abs/1606.02891v2","paper_title":"Edinburgh Neural Machine Translation Systems for WMT 16","code":"https://github.com/rsennrich/wmt16-scripts","n_code_links":1,"syntology":{"n_ran":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"Deep Convolutional Encoder; single-layer decoder","metrics":{"BLEU score":"27.8"},"uses_additional_data":false,"paper_date":"2016-11-07","paper":"/paper/a-convolutional-encoder-model-for-neural","paper_url":"http://arxiv.org/abs/1611.02344v3","paper_title":"A Convolutional Encoder Model for Neural Machine Translation","code":"https://github.com/facebookresearch/fairseq","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"BiLSTM","metrics":{"BLEU score":"27.5"},"uses_additional_data":false,"paper_date":"2016-11-07","paper":"/paper/a-convolutional-encoder-model-for-neural","paper_url":"http://arxiv.org/abs/1611.02344v3","paper_title":"A Convolutional Encoder Model for Neural Machine Translation","code":"https://github.com/facebookresearch/fairseq","n_code_links":2,"syntology":null},{"rank_in_archive_order":16,"model":"PBSMT + NMT","metrics":{"BLEU score":"25.13"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":null},{"rank_in_archive_order":17,"model":"Unsupervised PBSMT","metrics":{"BLEU score":"21.33"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":null},{"rank_in_archive_order":18,"model":"Unsupervised NMT + Transformer","metrics":{"BLEU score":"21.18"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"syntology":null},{"rank_in_archive_order":19,"model":"FLAN 137B (few-shot, k=9)","metrics":{"BLEU score":"20.5"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":20,"model":"FLAN 137B (zero-shot)","metrics":{"BLEU score":"18.9"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":21,"model":"BART (TextBox 2.0)","metrics":{"BLEU-4":"37.2"},"uses_additional_data":false,"paper_date":"2022-12-26","paper":"/paper/textbox-2-0-a-text-generation-library-with","paper_url":"https://arxiv.org/abs/2212.13005v1","paper_title":"TextBox 2.0: A Text Generation Library with Pre-trained Language Models","code":"https://github.com/RUCAIBox/TextBox","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":14,"rows_with_any_sample_ran":11,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":6,"samples_over_distinct_papers":{"n_ran":12,"n_unverified":7,"n_samples":19,"n_pointer_only_licence":2,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":19,"n_unverified":10,"n_samples":29,"n_pointer_only_licence":2,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}