{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/wmt-2014","name":"WMT 2014","full_name":null,"description_markdown":"**WMT 2014** is a collection of datasets used in shared tasks of the Ninth Workshop on Statistical Machine Translation. The workshop featured four tasks:\r\n\r\n* a news translation task,\r\n* a quality estimation task,\r\n* a metrics task,\r\n* a medical text translation task.\r\n\r\nSource: [https://www.aclweb.org/anthology/W14-3302.pdf](https://www.aclweb.org/anthology/W14-3302.pdf)","description_withheld":null,"homepage":"http://www.statmt.org/wmt14/index.html","introduced_date":"2014-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/findings-of-the-2014-workshop-on-statistical","title":"Findings of the 2014 Workshop on Statistical Machine Translation","first_author":"Ondrej Bojar","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Machine Translation","url":"/task/machine-translation","datasets_with_task":"/datasets/task/machine-translation"},{"name":"Translation deu-eng","url":"/task/translation-deu-eng","datasets_with_task":"/datasets/task/translation-deu-eng"},{"name":"Translation eng-deu","url":"/task/translation-eng-deu","datasets_with_task":"/datasets/task/translation-eng-deu"},{"name":"Unsupervised Machine Translation","url":"/task/unsupervised-machine-translation","datasets_with_task":"/datasets/task/unsupervised-machine-translation"}],"languages":[{"name":"Tamil","url":"/datasets/language/tamil"}],"variants":["WMT-newstest2014-deen","WMT 2014 News","newstest2014-deen eng-deu","newstest2014-deen deu-eng","newstest2014-deen","wmt14","WMT 2014","WMT2014 German-English","WMT2014 English-Czech","WMT 2014 EN-FR","WMT 2014 EN-DE","WMT2014 English-German","WMT2014 French-English","WMT2014 English-French"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/wmt/wmt14","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/wmt14","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/facebookresearch/ParlAI","url":"https://parl.ai/docs/tasks.html#wmt","frameworks":["pytorch"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/wmt14_translate","frameworks":["tf","jax"]}],"num_papers_in_archive":288,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/machine-translation-on-wmt2014-english-german","task":"Machine Translation","dataset_variant":"WMT2014 English-German","rows":91,"metrics":["BLEU score","SacreBLEU","Number of Params","Hardware Burden","Operations per network pass"],"first_row_in_archive_order":{"model":"Transformer Cycle (Rev)","paper":"/paper/lessons-on-parameter-sharing-across-layers-in","metrics":{"BLEU score":"35.14","SacreBLEU":"33.54"},"code_links":[{"title":"takase/share_layer_params","url":"https://github.com/takase/share_layer_params"},{"title":"jaketae/param-share-transformer","url":"https://github.com/jaketae/param-share-transformer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/machine-translation-on-wmt2014-english-french","task":"Machine Translation","dataset_variant":"WMT2014 English-French","rows":57,"metrics":["BLEU score","SacreBLEU","Hardware Burden","Operations per network pass"],"first_row_in_archive_order":{"model":"Transformer+BT (ADMIN init)","paper":"/paper/very-deep-transformers-for-neural-machine","metrics":{"BLEU score":"46.4","SacreBLEU":"44.4"},"code_links":[{"title":"LiyuanLucasLiu/Transforemr-Clinic","url":"https://github.com/LiyuanLucasLiu/Transforemr-Clinic"},{"title":"LiyuanLucasLiu/Transformer-Clinic","url":"https://github.com/LiyuanLucasLiu/Transformer-Clinic"},{"title":"microsoft/deepnmt","url":"https://github.com/microsoft/deepnmt"},{"title":"namisan/exdeep-nmt","url":"https://github.com/namisan/exdeep-nmt"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/machine-translation-on-wmt2014-german-english","task":"Machine Translation","dataset_variant":"WMT2014 German-English","rows":16,"metrics":["BLEU score"],"first_row_in_archive_order":{"model":"Bi-SimCut","paper":"/paper/bi-simcut-a-simple-strategy-for-boosting-1","metrics":{"BLEU score":"35.15"},"code_links":[{"title":"gpengzhi/Bi-SimCut","url":"https://github.com/gpengzhi/Bi-SimCut"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-machine-translation-on-wmt2014-1","task":"Unsupervised Machine Translation","dataset_variant":"WMT2014 French-English","rows":7,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"GPT-3 175B (Few-Shot)","paper":"/paper/language-models-are-few-shot-learners","metrics":{"BLEU":"39.2"},"code_links":[{"title":"ggml-org/llama.cpp","url":"https://github.com/ggml-org/llama.cpp"},{"title":"ggerganov/llama.cpp","url":"https://github.com/ggerganov/llama.cpp"},{"title":"karpathy/llm.c","url":"https://github.com/karpathy/llm.c"},{"title":"openai/gpt-3","url":"https://github.com/openai/gpt-3"},{"title":"PaddlePaddle/PaddleNLP","url":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/examples/language_model/gpt-3"},{"title":"EleutherAI/lm_evaluation_harness","url":"https://github.com/EleutherAI/lm_evaluation_harness"},{"title":"EleutherAI/lm-evaluation-harness","url":"https://github.com/EleutherAI/lm-evaluation-harness"},{"title":"EleutherAI/gpt-neo","url":"https://github.com/EleutherAI/gpt-neo"},{"title":"karpathy/build-nanogpt","url":"https://github.com/karpathy/build-nanogpt"},{"title":"ncoop57/gpt-code-clippy","url":"https://github.com/ncoop57/gpt-code-clippy"},{"title":"codedotal/gpt-code-clippy","url":"https://github.com/codedotal/gpt-code-clippy"},{"title":"bigscience-workshop/promptsource","url":"https://github.com/bigscience-workshop/promptsource"},{"title":"shreyashankar/gpt3-sandbox","url":"https://github.com/shreyashankar/gpt3-sandbox"},{"title":"bigscience-workshop/Megatron-DeepSpeed","url":"https://github.com/bigscience-workshop/Megatron-DeepSpeed"},{"title":"NVIDIA/NeMo-Curator","url":"https://github.com/NVIDIA/NeMo-Curator"},{"title":"RUCAIBox/LLMBox","url":"https://github.com/RUCAIBox/LLMBox"},{"title":"hazyresearch/ama_prompting","url":"https://github.com/hazyresearch/ama_prompting"},{"title":"allenai/macaw","url":"https://github.com/allenai/macaw"},{"title":"facebookresearch/anli","url":"https://github.com/facebookresearch/anli"},{"title":"tonyzhaozh/few-shot-learning","url":"https://github.com/tonyzhaozh/few-shot-learning"},{"title":"haiyang-w/git","url":"https://github.com/haiyang-w/git"},{"title":"volcengine/vegiantmodel","url":"https://github.com/volcengine/vegiantmodel"},{"title":"mindspore-ai/models","url":"https://github.com/mindspore-ai/models/tree/master/official/nlp/gpt"},{"title":"asahi417/lmppl","url":"https://github.com/asahi417/lmppl"},{"title":"ethanjperez/true_few_shot","url":"https://github.com/ethanjperez/true_few_shot"},{"title":"ai21labs/lm-evaluation","url":"https://github.com/ai21labs/lm-evaluation"},{"title":"lambert-x/prolab","url":"https://github.com/lambert-x/prolab"},{"title":"asahi417/relbert","url":"https://github.com/asahi417/relbert"},{"title":"grantslatton/llama.cpp","url":"https://github.com/grantslatton/llama.cpp"},{"title":"milmor/GPT","url":"https://github.com/milmor/GPT"},{"title":"um-arm-lab/efficient-eng-2-ltl","url":"https://github.com/um-arm-lab/efficient-eng-2-ltl"},{"title":"abhaskumarsinha/MinimalGPT","url":"https://github.com/abhaskumarsinha/MinimalGPT"},{"title":"turkunlp/megatron-deepspeed","url":"https://github.com/turkunlp/megatron-deepspeed"},{"title":"contextlab/abstract2paper","url":"https://github.com/contextlab/abstract2paper"},{"title":"kyegomez/GPT3","url":"https://github.com/kyegomez/GPT3"},{"title":"Samyu0304/thought-propagation","url":"https://github.com/Samyu0304/thought-propagation"},{"title":"smarton-empower/smarton-ai","url":"https://github.com/smarton-empower/smarton-ai"},{"title":"smile-data/smile","url":"https://github.com/smile-data/smile"},{"title":"postech-ami/smile-dataset","url":"https://github.com/postech-ami/smile-dataset"},{"title":"opengptx/lm-evaluation-harness","url":"https://github.com/opengptx/lm-evaluation-harness"},{"title":"gmum/dl-mo-2021","url":"https://github.com/gmum/dl-mo-2021"},{"title":"fywalter/label-bias","url":"https://github.com/fywalter/label-bias"},{"title":"nlx-group/overlapy","url":"https://github.com/nlx-group/overlapy"},{"title":"openbiolink/promptsource","url":"https://github.com/openbiolink/promptsource"},{"title":"insait-institute/lm-evaluation-harness-bg","url":"https://github.com/insait-institute/lm-evaluation-harness-bg"},{"title":"x-lance/neusym-rag","url":"https://github.com/x-lance/neusym-rag"},{"title":"crazydigger/Callibration-of-GPT","url":"https://github.com/crazydigger/Callibration-of-GPT"},{"title":"abhaskumarsinha/Corpus2GPT","url":"https://github.com/abhaskumarsinha/Corpus2GPT"},{"title":"vilm-ai/viet-llm-eval","url":"https://github.com/vilm-ai/viet-llm-eval"},{"title":"roberttwomey/machine-imagination-workshop","url":"https://github.com/roberttwomey/machine-imagination-workshop"},{"title":"VachanVY/gpt.jax","url":"https://github.com/VachanVY/gpt.jax"},{"title":"neuralmagic/lm-evaluation-harness","url":"https://github.com/neuralmagic/lm-evaluation-harness"},{"title":"scrayish/ML_NLP","url":"https://github.com/scrayish/ML_NLP"},{"title":"sambanova/lm-evaluation-harness","url":"https://github.com/sambanova/lm-evaluation-harness"},{"title":"roberttwomey/machine-imagination-isea","url":"https://github.com/roberttwomey/machine-imagination-isea"},{"title":"ltruncel/Microsoft_Azure_50daysofudacity","url":"https://github.com/ltruncel/Microsoft_Azure_50daysofudacity"},{"title":"ramanakshay/nanogpt","url":"https://github.com/ramanakshay/nanogpt"},{"title":"juletx/lm-evaluation-harness","url":"https://github.com/juletx/lm-evaluation-harness"},{"title":"national-center-for-ai-saudi-arabia/lm-evaluation-harness","url":"https://github.com/national-center-for-ai-saudi-arabia/lm-evaluation-harness"},{"title":"hilberthit/gpt-3","url":"https://github.com/hilberthit/gpt-3"},{"title":"longhao-chen/aicas2024","url":"https://github.com/longhao-chen/aicas2024"},{"title":"EightRice/atn_GPT-3","url":"https://github.com/EightRice/atn_GPT-3"},{"title":"Mind23-2/MindCode-138","url":"https://github.com/Mind23-2/MindCode-138"},{"title":"mbzuai-paris/lm-evaluation-harness-atlas-chat","url":"https://github.com/mbzuai-paris/lm-evaluation-harness-atlas-chat"},{"title":"Sypherd/lm-evaluation-harness","url":"https://github.com/Sypherd/lm-evaluation-harness"},{"title":"hojjat-mokhtarabadi/promptsource","url":"https://github.com/hojjat-mokhtarabadi/promptsource"},{"title":"zphang/lm_evaluation_harness","url":"https://github.com/zphang/lm_evaluation_harness"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-machine-translation-on-wmt2014-2","task":"Unsupervised Machine Translation","dataset_variant":"WMT2014 English-French","rows":7,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"BERT-fused NMT","paper":"/paper/incorporating-bert-into-neural-machine-1","metrics":{"BLEU":"38.27"},"code_links":[{"title":"bert-nmt/bert-nmt","url":"https://github.com/bert-nmt/bert-nmt"},{"title":"vivekgohel56/Neural-machine-translation-english-to-polish","url":"https://github.com/vivekgohel56/Neural-machine-translation-english-to-polish"},{"title":"StuartCHAN/KARL","url":"https://github.com/StuartCHAN/KARL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/machine-translation-on-wmt2014-french-english","task":"Machine Translation","dataset_variant":"WMT2014 French-English","rows":3,"metrics":["BLEU score"],"first_row_in_archive_order":{"model":"FLAN 137B (few-shot, k=9)","paper":"/paper/finetuned-language-models-are-zero-shot","metrics":{"BLEU score":"37.9"},"code_links":[{"title":"hiyouga/llama-efficient-tuning","url":"https://github.com/hiyouga/llama-efficient-tuning"},{"title":"bigcode-project/starcoder","url":"https://github.com/bigcode-project/starcoder"},{"title":"bigscience-workshop/promptsource","url":"https://github.com/bigscience-workshop/promptsource"},{"title":"google-research/flan","url":"https://github.com/google-research/flan"},{"title":"ukplab/arxiv2025-inherent-limits-plms","url":"https://github.com/ukplab/arxiv2025-inherent-limits-plms"},{"title":"openbiolink/promptsource","url":"https://github.com/openbiolink/promptsource"},{"title":"MS-P3/code6","url":"https://github.com/MS-P3/code6/tree/main/finetune"},{"title":"hojjat-mokhtarabadi/promptsource","url":"https://github.com/hojjat-mokhtarabadi/promptsource"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/machine-translation-on-wmt2014-english-czech","task":"Machine Translation","dataset_variant":"WMT2014 English-Czech","rows":2,"metrics":["BLEU score"],"first_row_in_archive_order":{"model":"Evolved Transformer Big","paper":"/paper/the-evolved-transformer","metrics":{"BLEU score":"28.2"},"code_links":[{"title":"tensorflow/tensor2tensor","url":"https://github.com/tensorflow/tensor2tensor"},{"title":"nazarov-yuriy/zh-ru-shared-task","url":"https://github.com/nazarov-yuriy/zh-ru-shared-task"},{"title":"moon23k/Transformer_Archs","url":"https://github.com/moon23k/Transformer_Archs"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-machine-translation-on-wmt2014","task":"Unsupervised Machine Translation","dataset_variant":"WMT2014 English-German","rows":2,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"SMT + NMT (tuning and joint refinement)","paper":"/paper/an-effective-approach-to-unsupervised-machine","metrics":{"BLEU":"22.5"},"code_links":[{"title":"artetxem/monoses","url":"https://github.com/artetxem/monoses"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/unsupervised-machine-translation-on-wmt2014-3","task":"Unsupervised Machine Translation","dataset_variant":"WMT2014 German-English","rows":2,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"SMT + NMT (tuning and joint refinement)","paper":"/paper/an-effective-approach-to-unsupervised-machine","metrics":{"BLEU":"27.0"},"code_links":[{"title":"artetxem/monoses","url":"https://github.com/artetxem/monoses"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":89,"of":89,"counts":{"papers_with_a_benchmark_row":89,"with_a_code_link":81,"where_syntology_ran_a_sample":40,"not_listed_spam_title":0,"listed":89,"listed_where_code_ran":40,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":33,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":33,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/partialformer-modeling-part-instead-of-whole","slug":"partialformer-modeling-part-instead-of-whole","title":"PartialFormer: Modeling Part Instead of Whole for Machine Translation","date":"2023-10-23","arxiv_id":"2310.14921","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mega-moving-average-equipped-gated-attention","slug":"mega-moving-average-equipped-gated-attention","title":"Mega: Moving Average Equipped Gated Attention","date":"2022-09-21","arxiv_id":"2209.10655","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":12,"samples_constructed":6,"samples_ran_checked":7,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":11,"official":{"repos":["facebookresearch/mega"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mega-moving-average-equipped-gated-attention#ran","syntology_url":"https://syntology.ai/paper/2209.10655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.10655"}}}},{"paper":"/paper/bi-simcut-a-simple-strategy-for-boosting-1","slug":"bi-simcut-a-simple-strategy-for-boosting-1","title":"Bi-SimCut: A Simple Strategy for Boosting Neural Machine Translation","date":"2022-06-06","arxiv_id":"2206.02368","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/bert-mbert-or-bibert-a-study-on","slug":"bert-mbert-or-bibert-a-study-on","title":"BERT, mBERT, or BiBERT? A Study on Contextualized Embeddings for Neural Machine Translation","date":"2021-09-09","arxiv_id":"2109.04588","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["fe1ixxu/BiBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert-mbert-or-bibert-a-study-on#ran","syntology_url":"https://syntology.ai/paper/2109.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04588"}}}},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":4,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/r-drop-regularized-dropout-for-neural","slug":"r-drop-regularized-dropout-for-neural","title":"R-Drop: Regularized Dropout for Neural Networks","date":"2021-06-28","arxiv_id":"2106.14448","rows_on_this_dataset":2,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["dropreg/R-Drop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-drop-regularized-dropout-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.14448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14448"}}}},{"paper":"/paper/resmlp-feedforward-networks-for-image","slug":"resmlp-feedforward-networks-for-image","title":"ResMLP: Feedforward networks for image classification with data-efficient training","date":"2021-05-07","arxiv_id":"2105.03404","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["facebookresearch/deit"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/resmlp-feedforward-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2105.03404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03404"}}}},{"paper":"/paper/lessons-on-parameter-sharing-across-layers-in","slug":"lessons-on-parameter-sharing-across-layers-in","title":"Lessons on Parameter Sharing across Layers in Transformers","date":"2021-04-13","arxiv_id":"2104.06022","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["takase/share_layer_params"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lessons-on-parameter-sharing-across-layers-in#ran","syntology_url":"https://syntology.ai/paper/2104.06022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06022"}}}},{"paper":"/paper/rethinking-perturbations-in-encoder-decoders","slug":"rethinking-perturbations-in-encoder-decoders","title":"Rethinking Perturbations in Encoder-Decoders for Fast Training","date":"2021-04-05","arxiv_id":"2104.01853","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["takase/rethink_perturbations"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rethinking-perturbations-in-encoder-decoders#ran","syntology_url":"https://syntology.ai/paper/2104.01853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01853"}}}},{"paper":"/paper/mask-attention-networks-rethinking-and","slug":"mask-attention-networks-rethinking-and","title":"Mask Attention Networks: Rethinking and Strengthen Transformer","date":"2021-03-25","arxiv_id":"2103.13597","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mask-attention-networks-rethinking-and#ran","syntology_url":"https://syntology.ai/paper/2103.13597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13597"}}}},{"paper":"/paper/finetuning-pretrained-transformers-into-rnns","slug":"finetuning-pretrained-transformers-into-rnns","title":"Finetuning Pretrained Transformers into RNNs","date":"2021-03-24","arxiv_id":"2103.13076","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuning-pretrained-transformers-into-rnns#ran","syntology_url":"https://syntology.ai/paper/2103.13076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13076"}}}},{"paper":"/paper/non-autoregressive-translation-by-learning","slug":"non-autoregressive-translation-by-learning","title":"Non-Autoregressive Translation by Learning Target Categorical Codes","date":"2021-03-21","arxiv_id":"2103.11405","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/random-feature-attention-1","slug":"random-feature-attention-1","title":"Random Feature Attention","date":"2021-03-03","arxiv_id":"2103.02143","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/omninet-omnidirectional-representations-from","slug":"omninet-omnidirectional-representations-from","title":"OmniNet: Omnidirectional Representations from Transformers","date":"2021-03-01","arxiv_id":"2103.01075","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/autodropout-learning-dropout-patterns-to","slug":"autodropout-learning-dropout-patterns-to","title":"AutoDropout: Learning Dropout Patterns to Regularize Deep Networks","date":"2021-01-05","arxiv_id":"2101.01761","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/subformer-a-parameter-reduced-transformer","slug":"subformer-a-parameter-reduced-transformer","title":"Subformer: A Parameter Reduced Transformer","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/incorporating-a-local-translation-mechanism","slug":"incorporating-a-local-translation-mechanism","title":"Incorporating a Local Translation Mechanism into Non-autoregressive Translation","date":"2020-11-12","arxiv_id":"2011.06132","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["shawnkx/NAT-with-Local-AT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/incorporating-a-local-translation-mechanism#ran","syntology_url":"https://syntology.ai/paper/2011.06132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06132"}}}},{"paper":"/paper/pre-training-multilingual-neural-machine","slug":"pre-training-multilingual-neural-machine","title":"Pre-training Multilingual Neural Machine Translation by Leveraging Alignment Information","date":"2020-10-07","arxiv_id":"2010.03142","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/glancing-transformer-for-non-autoregressive","slug":"glancing-transformer-for-non-autoregressive","title":"Glancing Transformer for Non-Autoregressive Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07905","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/very-deep-transformers-for-neural-machine","slug":"very-deep-transformers-for-neural-machine","title":"Very Deep Transformers for Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07772","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["namisan/exdeep-nmt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/very-deep-transformers-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2008.07772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07772"}}}},{"paper":"/paper/advaug-robust-adversarial-augmentation-for-1","slug":"advaug-robust-adversarial-augmentation-for-1","title":"AdvAug: Robust Adversarial Augmentation for Neural Machine Translation","date":"2020-06-21","arxiv_id":"2006.11834","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/multi-branch-attentive-transformer","slug":"multi-branch-attentive-transformer","title":"Multi-branch Attentive Transformer","date":"2020-06-18","arxiv_id":"2006.10270","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-branch-attentive-transformer#ran","syntology_url":"https://syntology.ai/paper/2006.10270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10270"}}}},{"paper":"/paper/hat-hardware-aware-transformers-for-efficient","slug":"hat-hardware-aware-transformers-for-efficient","title":"HAT: Hardware-Aware Transformers for Efficient Natural Language Processing","date":"2020-05-28","arxiv_id":"2005.14187","rows_on_this_dataset":2,"code_links":4,"syntology":null},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/synthesizer-rethinking-self-attention-in","slug":"synthesizer-rethinking-self-attention-in","title":"Synthesizer: Rethinking Self-Attention in Transformer Models","date":"2020-05-02","arxiv_id":"2005.00743","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/synthesizer-rethinking-self-attention-in#ran","syntology_url":"https://syntology.ai/paper/2005.00743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00743"}}}},{"paper":"/paper/lite-transformer-with-long-short-range","slug":"lite-transformer-with-long-short-range","title":"Lite Transformer with Long-Short Range Attention","date":"2020-04-24","arxiv_id":"2004.11886","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/understanding-the-difficulty-of-training","slug":"understanding-the-difficulty-of-training","title":"Understanding the Difficulty of Training Transformers","date":"2020-04-17","arxiv_id":"2004.08249","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/understanding-the-difficulty-of-training#ran","syntology_url":"https://syntology.ai/paper/2004.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08249"}}}},{"paper":"/paper/rethinking-batch-normalization-in","slug":"rethinking-batch-normalization-in","title":"PowerNorm: Rethinking Batch Normalization in Transformers","date":"2020-03-17","arxiv_id":"2003.07845","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}}}},{"paper":"/paper/wide-minima-density-hypothesis-and-the","slug":"wide-minima-density-hypothesis-and-the","title":"Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedule","date":"2020-03-09","arxiv_id":"2003.03977","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/incorporating-bert-into-neural-machine-1","slug":"incorporating-bert-into-neural-machine-1","title":"Incorporating BERT into Neural Machine Translation","date":"2020-02-17","arxiv_id":"2002.06823","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/time-aware-large-kernel-convolutions","slug":"time-aware-large-kernel-convolutions","title":"Time-aware Large Kernel Convolutions","date":"2020-02-08","arxiv_id":"2002.03184","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["lioutasb/TaLKConvolutions"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/time-aware-large-kernel-convolutions#ran","syntology_url":"https://syntology.ai/paper/2002.03184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03184"}}}},{"paper":"/paper/non-autoregressive-translation-with","slug":"non-autoregressive-translation-with","title":"Non-autoregressive Translation with Disentangled Context Transformer","date":"2020-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/muse-parallel-multi-scale-attention-for","slug":"muse-parallel-multi-scale-attention-for","title":"MUSE: Parallel Multi-Scale Attention for Sequence to Sequence Learning","date":"2019-11-17","arxiv_id":"1911.09483","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["lancopku/MUSE"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/muse-parallel-multi-scale-attention-for#ran","syntology_url":"https://syntology.ai/paper/1911.09483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09483"}}}},{"paper":"/paper/data-diversification-an-elegant-strategy-for","slug":"data-diversification-an-elegant-strategy-for","title":"Data Diversification: A Simple Strategy For Neural Machine Translation","date":"2019-11-05","arxiv_id":"1911.01986","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["nxphi47/data_diversification"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/data-diversification-an-elegant-strategy-for#ran","syntology_url":"https://syntology.ai/paper/1911.01986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01986"}}}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":2,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/flowseq-non-autoregressive-conditional","slug":"flowseq-non-autoregressive-conditional","title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","date":"2019-09-05","arxiv_id":"1909.02480","rows_on_this_dataset":10,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["XuezheMax/flowseq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/flowseq-non-autoregressive-conditional#ran","syntology_url":"https://syntology.ai/paper/1909.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02480"}}}},{"paper":"/paper/adaptively-sparse-transformers","slug":"adaptively-sparse-transformers","title":"Adaptively Sparse Transformers","date":"2019-08-30","arxiv_id":"1909.00015","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["deep-spin/entmax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adaptively-sparse-transformers#ran","syntology_url":"https://syntology.ai/paper/1909.00015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00015"}}}},{"paper":"/paper/depth-growing-for-neural-machine-translation","slug":"depth-growing-for-neural-machine-translation","title":"Depth Growing for Neural Machine Translation","date":"2019-07-03","arxiv_id":"1907.01968","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/improving-neural-language-modeling-via","slug":"improving-neural-language-modeling-via","title":"Improving Neural Language Modeling via Adversarial Training","date":"2019-06-10","arxiv_id":"1906.03805","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kermit-generative-insertion-based-modeling","slug":"kermit-generative-insertion-based-modeling","title":"KERMIT: Generative Insertion-Based Modeling for Sequences","date":"2019-06-04","arxiv_id":"1906.01604","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/levenshtein-transformer","slug":"levenshtein-transformer","title":"Levenshtein Transformer","date":"2019-05-27","arxiv_id":"1905.11006","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/190506596","slug":"190506596","title":"Joint Source-Target Self Attention with Locality Constraints","date":"2019-05-16","arxiv_id":"1905.06596","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deep-residual-output-layers-for-neural","slug":"deep-residual-output-layers-for-neural","title":"Deep Residual Output Layers for Neural Language Generation","date":"2019-05-14","arxiv_id":"1905.05513","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/synchronous-bidirectional-neural-machine","slug":"synchronous-bidirectional-neural-machine","title":"Synchronous Bidirectional Neural Machine Translation","date":"2019-05-13","arxiv_id":"1905.04847","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/mass-masked-sequence-to-sequence-pre-training","slug":"mass-masked-sequence-to-sequence-pre-training","title":"MASS: Masked Sequence to Sequence Pre-training for Language Generation","date":"2019-05-07","arxiv_id":"1905.02450","rows_on_this_dataset":2,"code_links":7,"syntology":null},{"paper":"/paper/an-effective-approach-to-unsupervised-machine","slug":"an-effective-approach-to-unsupervised-machine","title":"An Effective Approach to Unsupervised Machine Translation","date":"2019-02-04","arxiv_id":"1902.01313","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/memory-efficient-adaptive-optimization-for","slug":"memory-efficient-adaptive-optimization-for","title":"Memory-Efficient Adaptive Optimization","date":"2019-01-30","arxiv_id":"1901.11150","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/the-evolved-transformer","slug":"the-evolved-transformer","title":"The Evolved Transformer","date":"2019-01-30","arxiv_id":"1901.11117","rows_on_this_dataset":6,"code_links":3,"syntology":null},{"paper":"/paper/pay-less-attention-with-lightweight-and","slug":"pay-less-attention-with-lightweight-and","title":"Pay Less Attention with Lightweight and Dynamic Convolutions","date":"2019-01-29","arxiv_id":"1901.10430","rows_on_this_dataset":4,"code_links":3,"syntology":null},{"paper":"/paper/cross-lingual-language-model-pretraining","slug":"cross-lingual-language-model-pretraining","title":"Cross-lingual Language Model Pretraining","date":"2019-01-22","arxiv_id":"1901.07291","rows_on_this_dataset":2,"code_links":17,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cross-lingual-language-model-pretraining#ran","syntology_url":"https://syntology.ai/paper/1901.07291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07291"}}}},{"paper":"/paper/unsupervised-neural-machine-translation-with","slug":"unsupervised-neural-machine-translation-with","title":"Unsupervised Neural Machine Translation with SMT as Posterior Regularization","date":"2019-01-14","arxiv_id":"1901.04112","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":{"repos":["Imagist-Shuo/UNMT-SPR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-neural-machine-translation-with#ran","syntology_url":"https://syntology.ai/paper/1901.04112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04112"}}}},{"paper":"/paper/neural-machine-translation-with-adequacy","slug":"neural-machine-translation-with-adequacy","title":"Neural Machine Translation with Adequacy-Oriented Learning","date":"2018-11-21","arxiv_id":"1811.08541","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/modeling-localness-for-self-attention","slug":"modeling-localness-for-self-attention","title":"Modeling Localness for Self-Attention Networks","date":"2018-10-24","arxiv_id":"1810.10182","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fast-and-simple-mixture-of-softmaxes-with-bpe","slug":"fast-and-simple-mixture-of-softmaxes-with-bpe","title":"Fast and Simple Mixture of Softmaxes with BPE and Hybrid-LightRNN for Language Generation","date":"2018-09-25","arxiv_id":"1809.09296","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/unsupervised-statistical-machine-translation","slug":"unsupervised-statistical-machine-translation","title":"Unsupervised Statistical Machine Translation","date":"2018-09-04","arxiv_id":"1809.01272","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/understanding-back-translation-at-scale","slug":"understanding-back-translation-at-scale","title":"Understanding Back-Translation at Scale","date":"2018-08-28","arxiv_id":"1808.09381","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/understanding-back-translation-at-scale#ran","syntology_url":"https://syntology.ai/paper/1808.09381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09381"}}}},{"paper":"/paper/universal-transformers","slug":"universal-transformers","title":"Universal Transformers","date":"2018-07-10","arxiv_id":"1807.03819","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":17,"samples_constructed":8,"samples_ran_checked":17,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":24,"official":{"repos":["tensorflow/tensor2tensor"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-transformers#ran","syntology_url":"https://syntology.ai/paper/1807.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03819"}}}},{"paper":"/paper/dense-information-flow-for-neural-machine","slug":"dense-information-flow-for-neural-machine","title":"Dense Information Flow for Neural Machine Translation","date":"2018-06-03","arxiv_id":"1806.00722","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scaling-neural-machine-translation","slug":"scaling-neural-machine-translation","title":"Scaling Neural Machine Translation","date":"2018-06-01","arxiv_id":"1806.00187","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/accelerating-neural-transformer-via-an","slug":"accelerating-neural-transformer-via-an","title":"Accelerating Neural Transformer via an Average Attention Network","date":"2018-05-02","arxiv_id":"1805.00631","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":12,"pointer_only_for_licence":0,"official":{"repos":["bzhangXMU/transformer-aan"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":12,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accelerating-neural-transformer-via-an#ran","syntology_url":"https://syntology.ai/paper/1805.00631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.00631"}}}},{"paper":"/paper/the-best-of-both-worlds-combining-recent","slug":"the-best-of-both-worlds-combining-recent","title":"The Best of Both Worlds: Combining Recent Advances in Neural Machine Translation","date":"2018-04-26","arxiv_id":"1804.09849","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/phrase-based-neural-unsupervised-machine","slug":"phrase-based-neural-unsupervised-machine","title":"Phrase-Based & Neural Unsupervised Machine Translation","date":"2018-04-20","arxiv_id":"1804.07755","rows_on_this_dataset":8,"code_links":14,"syntology":null},{"paper":"/paper/self-attention-with-relative-position","slug":"self-attention-with-relative-position","title":"Self-Attention with Relative Position Representations","date":"2018-03-06","arxiv_id":"1803.02155","rows_on_this_dataset":2,"code_links":13,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":10,"pointer_only_for_licence":3,"official":{"repos":["tensorflow/tensor2tensor"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/self-attention-with-relative-position#ran","syntology_url":"https://syntology.ai/paper/1803.02155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02155"}}}},{"paper":"/paper/deterministic-non-autoregressive-neural","slug":"deterministic-non-autoregressive-neural","title":"Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement","date":"2018-02-19","arxiv_id":"1802.06901","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["nyu-dl/dl4mt-nonauto"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deterministic-non-autoregressive-neural#ran","syntology_url":"https://syntology.ai/paper/1802.06901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06901"}}}},{"paper":"/paper/deliberation-networks-sequence-generation","slug":"deliberation-networks-sequence-generation","title":"Deliberation Networks: Sequence Generation Beyond One-Pass Decoding","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/non-autoregressive-neural-machine-translation-1","slug":"non-autoregressive-neural-machine-translation-1","title":"Non-Autoregressive Neural Machine Translation","date":"2017-11-07","arxiv_id":"1711.02281","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["salesforce/nonauto-nmt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/non-autoregressive-neural-machine-translation-1#ran","syntology_url":"https://syntology.ai/paper/1711.02281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02281"}}}},{"paper":"/paper/weighted-transformer-network-for-machine","slug":"weighted-transformer-network-for-machine","title":"Weighted Transformer Network for Machine Translation","date":"2017-11-06","arxiv_id":"1711.02132","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/weighted-transformer-network-for-machine#ran","syntology_url":"https://syntology.ai/paper/1711.02132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02132"}}}},{"paper":"/paper/unsupervised-neural-machine-translation","slug":"unsupervised-neural-machine-translation","title":"Unsupervised Neural Machine Translation","date":"2017-10-30","arxiv_id":"1710.11041","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":6,"official":{"repos":["artetxem/undreamt","rsennrich/subword-nmt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-neural-machine-translation#ran","syntology_url":"https://syntology.ai/paper/1710.11041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11041"}}}},{"paper":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["asappresearch/sru"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-recurrent-units-for-highly#ran","syntology_url":"https://syntology.ai/paper/1709.02755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.02755"}}}},{"paper":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","rows_on_this_dataset":4,"code_links":595,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":946,"samples_ran":610,"samples_constructed":293,"samples_ran_checked":529,"samples_ran_instrument_failed":81,"samples_unverified":336,"pointer_only_for_licence":451,"official":{"repos":["tensorflow/tensor2tensor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"paper":"/paper/depthwise-separable-convolutions-for-neural","slug":"depthwise-separable-convolutions-for-neural","title":"Depthwise Separable Convolutions for Neural Machine Translation","date":"2017-06-09","arxiv_id":"1706.03059","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/convolutional-sequence-to-sequence-learning","slug":"convolutional-sequence-to-sequence-learning","title":"Convolutional Sequence to Sequence Learning","date":"2017-05-08","arxiv_id":"1705.03122","rows_on_this_dataset":4,"code_links":37,"syntology":null},{"paper":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}}}},{"paper":"/paper/a-convolutional-encoder-model-for-neural","slug":"a-convolutional-encoder-model-for-neural","title":"A Convolutional Encoder Model for Neural Machine Translation","date":"2016-11-07","arxiv_id":"1611.02344","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/neural-machine-translation-in-linear-time","slug":"neural-machine-translation-in-linear-time","title":"Neural Machine Translation in Linear Time","date":"2016-10-31","arxiv_id":"1610.10099","rows_on_this_dataset":1,"code_links":11,"syntology":null},{"paper":"/paper/can-active-memory-replace-attention","slug":"can-active-memory-replace-attention","title":"Can Active Memory Replace Attention?","date":"2016-10-27","arxiv_id":"1610.08613","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/googles-neural-machine-translation-system","slug":"googles-neural-machine-translation-system","title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","date":"2016-09-26","arxiv_id":"1609.08144","rows_on_this_dataset":2,"code_links":28,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":46,"samples_ran":34,"samples_constructed":4,"samples_ran_checked":25,"samples_ran_instrument_failed":9,"samples_unverified":12,"pointer_only_for_licence":13,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/googles-neural-machine-translation-system#ran","syntology_url":"https://syntology.ai/paper/1609.08144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.08144"}}}},{"paper":"/paper/neural-semantic-encoders","slug":"neural-semantic-encoders","title":"Neural Semantic Encoders","date":"2016-07-14","arxiv_id":"1607.04315","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/sequence-level-knowledge-distillation","slug":"sequence-level-knowledge-distillation","title":"Sequence-Level Knowledge Distillation","date":"2016-06-25","arxiv_id":"1606.07947","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["harvardnlp/nmt-android","harvardnlp/seq2seq-attn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sequence-level-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/1606.07947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07947"}}}},{"paper":"/paper/deep-recurrent-models-with-fast-forward","slug":"deep-recurrent-models-with-fast-forward","title":"Deep Recurrent Models with Fast-Forward Connections for Neural Machine Translation","date":"2016-06-14","arxiv_id":"1606.04199","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/edinburghs-syntax-based-systems-at-wmt-2015","slug":"edinburghs-syntax-based-systems-at-wmt-2015","title":"Edinburgh's Syntax-Based Systems at WMT 2015","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/effective-approaches-to-attention-based","slug":"effective-approaches-to-attention-based","title":"Effective Approaches to Attention-based Neural Machine Translation","date":"2015-08-17","arxiv_id":"1508.04025","rows_on_this_dataset":3,"code_links":44,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/effective-approaches-to-attention-based#ran","syntology_url":"https://syntology.ai/paper/1508.04025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.04025"}}}},{"paper":"/paper/addressing-the-rare-word-problem-in-neural","slug":"addressing-the-rare-word-problem-in-neural","title":"Addressing the Rare Word Problem in Neural Machine Translation","date":"2014-10-30","arxiv_id":"1410.8206","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/sequence-to-sequence-learning-with-neural","slug":"sequence-to-sequence-learning-with-neural","title":"Sequence to Sequence Learning with Neural Networks","date":"2014-09-10","arxiv_id":"1409.3215","rows_on_this_dataset":2,"code_links":74,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":8,"samples_unverified":4,"pointer_only_for_licence":9,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sequence-to-sequence-learning-with-neural#ran","syntology_url":"https://syntology.ai/paper/1409.3215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.3215"}}}},{"paper":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["wojzaremba/lstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-neural-network-regularization#ran","syntology_url":"https://syntology.ai/paper/1409.2329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.2329"}}}},{"paper":"/paper/neural-machine-translation-by-jointly","slug":"neural-machine-translation-by-jointly","title":"Neural Machine Translation by Jointly Learning to Align and Translate","date":"2014-09-01","arxiv_id":"1409.0473","rows_on_this_dataset":1,"code_links":124,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":44,"samples_ran":41,"samples_constructed":2,"samples_ran_checked":24,"samples_ran_instrument_failed":17,"samples_unverified":3,"pointer_only_for_licence":16,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-machine-translation-by-jointly#ran","syntology_url":"https://syntology.ai/paper/1409.0473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.0473"}}}},{"paper":"/paper/learning-phrase-representations-using-rnn","slug":"learning-phrase-representations-using-rnn","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","date":"2014-06-03","arxiv_id":"1406.1078","rows_on_this_dataset":1,"code_links":42,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":13,"samples_constructed":6,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":9,"pointer_only_for_licence":14,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-phrase-representations-using-rnn#ran","syntology_url":"https://syntology.ai/paper/1406.1078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.1078"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/partialformer-modeling-part-instead-of-whole","slug":"partialformer-modeling-part-instead-of-whole","title":"PartialFormer: Modeling Part Instead of Whole for Machine Translation","date":"2023-10-23","arxiv_id":"2310.14921","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mega-moving-average-equipped-gated-attention","slug":"mega-moving-average-equipped-gated-attention","title":"Mega: Moving Average Equipped Gated Attention","date":"2022-09-21","arxiv_id":"2209.10655","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":12,"samples_constructed":6,"samples_ran_checked":7,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":11,"official":{"repos":["facebookresearch/mega"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mega-moving-average-equipped-gated-attention#ran","syntology_url":"https://syntology.ai/paper/2209.10655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.10655"}}}},{"paper":"/paper/bi-simcut-a-simple-strategy-for-boosting-1","slug":"bi-simcut-a-simple-strategy-for-boosting-1","title":"Bi-SimCut: A Simple Strategy for Boosting Neural Machine Translation","date":"2022-06-06","arxiv_id":"2206.02368","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/bert-mbert-or-bibert-a-study-on","slug":"bert-mbert-or-bibert-a-study-on","title":"BERT, mBERT, or BiBERT? A Study on Contextualized Embeddings for Neural Machine Translation","date":"2021-09-09","arxiv_id":"2109.04588","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["fe1ixxu/BiBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bert-mbert-or-bibert-a-study-on#ran","syntology_url":"https://syntology.ai/paper/2109.04588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.04588"}}}},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":4,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/r-drop-regularized-dropout-for-neural","slug":"r-drop-regularized-dropout-for-neural","title":"R-Drop: Regularized Dropout for Neural Networks","date":"2021-06-28","arxiv_id":"2106.14448","rows_on_this_dataset":2,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["dropreg/R-Drop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-drop-regularized-dropout-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.14448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14448"}}}},{"paper":"/paper/resmlp-feedforward-networks-for-image","slug":"resmlp-feedforward-networks-for-image","title":"ResMLP: Feedforward networks for image classification with data-efficient training","date":"2021-05-07","arxiv_id":"2105.03404","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["facebookresearch/deit"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/resmlp-feedforward-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2105.03404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03404"}}}},{"paper":"/paper/lessons-on-parameter-sharing-across-layers-in","slug":"lessons-on-parameter-sharing-across-layers-in","title":"Lessons on Parameter Sharing across Layers in Transformers","date":"2021-04-13","arxiv_id":"2104.06022","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["takase/share_layer_params"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lessons-on-parameter-sharing-across-layers-in#ran","syntology_url":"https://syntology.ai/paper/2104.06022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06022"}}}},{"paper":"/paper/rethinking-perturbations-in-encoder-decoders","slug":"rethinking-perturbations-in-encoder-decoders","title":"Rethinking Perturbations in Encoder-Decoders for Fast Training","date":"2021-04-05","arxiv_id":"2104.01853","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["takase/rethink_perturbations"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rethinking-perturbations-in-encoder-decoders#ran","syntology_url":"https://syntology.ai/paper/2104.01853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01853"}}}},{"paper":"/paper/mask-attention-networks-rethinking-and","slug":"mask-attention-networks-rethinking-and","title":"Mask Attention Networks: Rethinking and Strengthen Transformer","date":"2021-03-25","arxiv_id":"2103.13597","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mask-attention-networks-rethinking-and#ran","syntology_url":"https://syntology.ai/paper/2103.13597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13597"}}}},{"paper":"/paper/finetuning-pretrained-transformers-into-rnns","slug":"finetuning-pretrained-transformers-into-rnns","title":"Finetuning Pretrained Transformers into RNNs","date":"2021-03-24","arxiv_id":"2103.13076","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuning-pretrained-transformers-into-rnns#ran","syntology_url":"https://syntology.ai/paper/2103.13076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13076"}}}},{"paper":"/paper/non-autoregressive-translation-by-learning","slug":"non-autoregressive-translation-by-learning","title":"Non-Autoregressive Translation by Learning Target Categorical Codes","date":"2021-03-21","arxiv_id":"2103.11405","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/random-feature-attention-1","slug":"random-feature-attention-1","title":"Random Feature Attention","date":"2021-03-03","arxiv_id":"2103.02143","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/omninet-omnidirectional-representations-from","slug":"omninet-omnidirectional-representations-from","title":"OmniNet: Omnidirectional Representations from Transformers","date":"2021-03-01","arxiv_id":"2103.01075","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/autodropout-learning-dropout-patterns-to","slug":"autodropout-learning-dropout-patterns-to","title":"AutoDropout: Learning Dropout Patterns to Regularize Deep Networks","date":"2021-01-05","arxiv_id":"2101.01761","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/subformer-a-parameter-reduced-transformer","slug":"subformer-a-parameter-reduced-transformer","title":"Subformer: A Parameter Reduced Transformer","date":"2021-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/incorporating-a-local-translation-mechanism","slug":"incorporating-a-local-translation-mechanism","title":"Incorporating a Local Translation Mechanism into Non-autoregressive Translation","date":"2020-11-12","arxiv_id":"2011.06132","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["shawnkx/NAT-with-Local-AT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/incorporating-a-local-translation-mechanism#ran","syntology_url":"https://syntology.ai/paper/2011.06132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.06132"}}}},{"paper":"/paper/pre-training-multilingual-neural-machine","slug":"pre-training-multilingual-neural-machine","title":"Pre-training Multilingual Neural Machine Translation by Leveraging Alignment Information","date":"2020-10-07","arxiv_id":"2010.03142","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/glancing-transformer-for-non-autoregressive","slug":"glancing-transformer-for-non-autoregressive","title":"Glancing Transformer for Non-Autoregressive Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07905","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/very-deep-transformers-for-neural-machine","slug":"very-deep-transformers-for-neural-machine","title":"Very Deep Transformers for Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07772","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["namisan/exdeep-nmt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/very-deep-transformers-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2008.07772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07772"}}}},{"paper":"/paper/advaug-robust-adversarial-augmentation-for-1","slug":"advaug-robust-adversarial-augmentation-for-1","title":"AdvAug: Robust Adversarial Augmentation for Neural Machine Translation","date":"2020-06-21","arxiv_id":"2006.11834","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/multi-branch-attentive-transformer","slug":"multi-branch-attentive-transformer","title":"Multi-branch Attentive Transformer","date":"2020-06-18","arxiv_id":"2006.10270","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multi-branch-attentive-transformer#ran","syntology_url":"https://syntology.ai/paper/2006.10270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10270"}}}},{"paper":"/paper/hat-hardware-aware-transformers-for-efficient","slug":"hat-hardware-aware-transformers-for-efficient","title":"HAT: Hardware-Aware Transformers for Efficient Natural Language Processing","date":"2020-05-28","arxiv_id":"2005.14187","rows_on_this_dataset":2,"code_links":4,"syntology":null},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/synthesizer-rethinking-self-attention-in","slug":"synthesizer-rethinking-self-attention-in","title":"Synthesizer: Rethinking Self-Attention in Transformer Models","date":"2020-05-02","arxiv_id":"2005.00743","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/synthesizer-rethinking-self-attention-in#ran","syntology_url":"https://syntology.ai/paper/2005.00743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00743"}}}},{"paper":"/paper/lite-transformer-with-long-short-range","slug":"lite-transformer-with-long-short-range","title":"Lite Transformer with Long-Short Range Attention","date":"2020-04-24","arxiv_id":"2004.11886","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/understanding-the-difficulty-of-training","slug":"understanding-the-difficulty-of-training","title":"Understanding the Difficulty of Training Transformers","date":"2020-04-17","arxiv_id":"2004.08249","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/understanding-the-difficulty-of-training#ran","syntology_url":"https://syntology.ai/paper/2004.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08249"}}}},{"paper":"/paper/rethinking-batch-normalization-in","slug":"rethinking-batch-normalization-in","title":"PowerNorm: Rethinking Batch Normalization in Transformers","date":"2020-03-17","arxiv_id":"2003.07845","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}}}},{"paper":"/paper/wide-minima-density-hypothesis-and-the","slug":"wide-minima-density-hypothesis-and-the","title":"Wide-minima Density Hypothesis and the Explore-Exploit Learning Rate Schedule","date":"2020-03-09","arxiv_id":"2003.03977","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/incorporating-bert-into-neural-machine-1","slug":"incorporating-bert-into-neural-machine-1","title":"Incorporating BERT into Neural Machine Translation","date":"2020-02-17","arxiv_id":"2002.06823","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/time-aware-large-kernel-convolutions","slug":"time-aware-large-kernel-convolutions","title":"Time-aware Large Kernel Convolutions","date":"2020-02-08","arxiv_id":"2002.03184","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["lioutasb/TaLKConvolutions"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/time-aware-large-kernel-convolutions#ran","syntology_url":"https://syntology.ai/paper/2002.03184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03184"}}}},{"paper":"/paper/non-autoregressive-translation-with","slug":"non-autoregressive-translation-with","title":"Non-autoregressive Translation with Disentangled Context Transformer","date":"2020-01-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/muse-parallel-multi-scale-attention-for","slug":"muse-parallel-multi-scale-attention-for","title":"MUSE: Parallel Multi-Scale Attention for Sequence to Sequence Learning","date":"2019-11-17","arxiv_id":"1911.09483","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["lancopku/MUSE"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/muse-parallel-multi-scale-attention-for#ran","syntology_url":"https://syntology.ai/paper/1911.09483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09483"}}}},{"paper":"/paper/data-diversification-an-elegant-strategy-for","slug":"data-diversification-an-elegant-strategy-for","title":"Data Diversification: A Simple Strategy For Neural Machine Translation","date":"2019-11-05","arxiv_id":"1911.01986","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["nxphi47/data_diversification"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/data-diversification-an-elegant-strategy-for#ran","syntology_url":"https://syntology.ai/paper/1911.01986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01986"}}}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":2,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/flowseq-non-autoregressive-conditional","slug":"flowseq-non-autoregressive-conditional","title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","date":"2019-09-05","arxiv_id":"1909.02480","rows_on_this_dataset":10,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["XuezheMax/flowseq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/flowseq-non-autoregressive-conditional#ran","syntology_url":"https://syntology.ai/paper/1909.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02480"}}}},{"paper":"/paper/adaptively-sparse-transformers","slug":"adaptively-sparse-transformers","title":"Adaptively Sparse Transformers","date":"2019-08-30","arxiv_id":"1909.00015","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["deep-spin/entmax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adaptively-sparse-transformers#ran","syntology_url":"https://syntology.ai/paper/1909.00015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00015"}}}},{"paper":"/paper/depth-growing-for-neural-machine-translation","slug":"depth-growing-for-neural-machine-translation","title":"Depth Growing for Neural Machine Translation","date":"2019-07-03","arxiv_id":"1907.01968","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/improving-neural-language-modeling-via","slug":"improving-neural-language-modeling-via","title":"Improving Neural Language Modeling via Adversarial Training","date":"2019-06-10","arxiv_id":"1906.03805","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/kermit-generative-insertion-based-modeling","slug":"kermit-generative-insertion-based-modeling","title":"KERMIT: Generative Insertion-Based Modeling for Sequences","date":"2019-06-04","arxiv_id":"1906.01604","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/levenshtein-transformer","slug":"levenshtein-transformer","title":"Levenshtein Transformer","date":"2019-05-27","arxiv_id":"1905.11006","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/190506596","slug":"190506596","title":"Joint Source-Target Self Attention with Locality Constraints","date":"2019-05-16","arxiv_id":"1905.06596","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deep-residual-output-layers-for-neural","slug":"deep-residual-output-layers-for-neural","title":"Deep Residual Output Layers for Neural Language Generation","date":"2019-05-14","arxiv_id":"1905.05513","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/synchronous-bidirectional-neural-machine","slug":"synchronous-bidirectional-neural-machine","title":"Synchronous Bidirectional Neural Machine Translation","date":"2019-05-13","arxiv_id":"1905.04847","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/mass-masked-sequence-to-sequence-pre-training","slug":"mass-masked-sequence-to-sequence-pre-training","title":"MASS: Masked Sequence to Sequence Pre-training for Language Generation","date":"2019-05-07","arxiv_id":"1905.02450","rows_on_this_dataset":2,"code_links":7,"syntology":null},{"paper":"/paper/an-effective-approach-to-unsupervised-machine","slug":"an-effective-approach-to-unsupervised-machine","title":"An Effective Approach to Unsupervised Machine Translation","date":"2019-02-04","arxiv_id":"1902.01313","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/memory-efficient-adaptive-optimization-for","slug":"memory-efficient-adaptive-optimization-for","title":"Memory-Efficient Adaptive Optimization","date":"2019-01-30","arxiv_id":"1901.11150","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/the-evolved-transformer","slug":"the-evolved-transformer","title":"The Evolved Transformer","date":"2019-01-30","arxiv_id":"1901.11117","rows_on_this_dataset":6,"code_links":3,"syntology":null},{"paper":"/paper/pay-less-attention-with-lightweight-and","slug":"pay-less-attention-with-lightweight-and","title":"Pay Less Attention with Lightweight and Dynamic Convolutions","date":"2019-01-29","arxiv_id":"1901.10430","rows_on_this_dataset":4,"code_links":3,"syntology":null},{"paper":"/paper/cross-lingual-language-model-pretraining","slug":"cross-lingual-language-model-pretraining","title":"Cross-lingual Language Model Pretraining","date":"2019-01-22","arxiv_id":"1901.07291","rows_on_this_dataset":2,"code_links":17,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cross-lingual-language-model-pretraining#ran","syntology_url":"https://syntology.ai/paper/1901.07291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07291"}}}},{"paper":"/paper/unsupervised-neural-machine-translation-with","slug":"unsupervised-neural-machine-translation-with","title":"Unsupervised Neural Machine Translation with SMT as Posterior Regularization","date":"2019-01-14","arxiv_id":"1901.04112","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":{"repos":["Imagist-Shuo/UNMT-SPR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-neural-machine-translation-with#ran","syntology_url":"https://syntology.ai/paper/1901.04112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.04112"}}}},{"paper":"/paper/neural-machine-translation-with-adequacy","slug":"neural-machine-translation-with-adequacy","title":"Neural Machine Translation with Adequacy-Oriented Learning","date":"2018-11-21","arxiv_id":"1811.08541","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/modeling-localness-for-self-attention","slug":"modeling-localness-for-self-attention","title":"Modeling Localness for Self-Attention Networks","date":"2018-10-24","arxiv_id":"1810.10182","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/fast-and-simple-mixture-of-softmaxes-with-bpe","slug":"fast-and-simple-mixture-of-softmaxes-with-bpe","title":"Fast and Simple Mixture of Softmaxes with BPE and Hybrid-LightRNN for Language Generation","date":"2018-09-25","arxiv_id":"1809.09296","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/frage-frequency-agnostic-word-representation","slug":"frage-frequency-agnostic-word-representation","title":"FRAGE: Frequency-Agnostic Word Representation","date":"2018-09-18","arxiv_id":"1809.06858","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/unsupervised-statistical-machine-translation","slug":"unsupervised-statistical-machine-translation","title":"Unsupervised Statistical Machine Translation","date":"2018-09-04","arxiv_id":"1809.01272","rows_on_this_dataset":5,"code_links":3,"syntology":null},{"paper":"/paper/understanding-back-translation-at-scale","slug":"understanding-back-translation-at-scale","title":"Understanding Back-Translation at Scale","date":"2018-08-28","arxiv_id":"1808.09381","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/understanding-back-translation-at-scale#ran","syntology_url":"https://syntology.ai/paper/1808.09381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09381"}}}},{"paper":"/paper/universal-transformers","slug":"universal-transformers","title":"Universal Transformers","date":"2018-07-10","arxiv_id":"1807.03819","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":17,"samples_constructed":8,"samples_ran_checked":17,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":24,"official":{"repos":["tensorflow/tensor2tensor"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/universal-transformers#ran","syntology_url":"https://syntology.ai/paper/1807.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03819"}}}},{"paper":"/paper/dense-information-flow-for-neural-machine","slug":"dense-information-flow-for-neural-machine","title":"Dense Information Flow for Neural Machine Translation","date":"2018-06-03","arxiv_id":"1806.00722","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/scaling-neural-machine-translation","slug":"scaling-neural-machine-translation","title":"Scaling Neural Machine Translation","date":"2018-06-01","arxiv_id":"1806.00187","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/accelerating-neural-transformer-via-an","slug":"accelerating-neural-transformer-via-an","title":"Accelerating Neural Transformer via an Average Attention Network","date":"2018-05-02","arxiv_id":"1805.00631","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":19,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":12,"pointer_only_for_licence":0,"official":{"repos":["bzhangXMU/transformer-aan"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":12,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accelerating-neural-transformer-via-an#ran","syntology_url":"https://syntology.ai/paper/1805.00631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.00631"}}}},{"paper":"/paper/the-best-of-both-worlds-combining-recent","slug":"the-best-of-both-worlds-combining-recent","title":"The Best of Both Worlds: Combining Recent Advances in Neural Machine Translation","date":"2018-04-26","arxiv_id":"1804.09849","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/phrase-based-neural-unsupervised-machine","slug":"phrase-based-neural-unsupervised-machine","title":"Phrase-Based & Neural Unsupervised Machine Translation","date":"2018-04-20","arxiv_id":"1804.07755","rows_on_this_dataset":8,"code_links":14,"syntology":null},{"paper":"/paper/self-attention-with-relative-position","slug":"self-attention-with-relative-position","title":"Self-Attention with Relative Position Representations","date":"2018-03-06","arxiv_id":"1803.02155","rows_on_this_dataset":2,"code_links":13,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":23,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":10,"pointer_only_for_licence":3,"official":{"repos":["tensorflow/tensor2tensor"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/self-attention-with-relative-position#ran","syntology_url":"https://syntology.ai/paper/1803.02155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02155"}}}},{"paper":"/paper/deterministic-non-autoregressive-neural","slug":"deterministic-non-autoregressive-neural","title":"Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement","date":"2018-02-19","arxiv_id":"1802.06901","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["nyu-dl/dl4mt-nonauto"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deterministic-non-autoregressive-neural#ran","syntology_url":"https://syntology.ai/paper/1802.06901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06901"}}}},{"paper":"/paper/deliberation-networks-sequence-generation","slug":"deliberation-networks-sequence-generation","title":"Deliberation Networks: Sequence Generation Beyond One-Pass Decoding","date":"2017-12-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/non-autoregressive-neural-machine-translation-1","slug":"non-autoregressive-neural-machine-translation-1","title":"Non-Autoregressive Neural Machine Translation","date":"2017-11-07","arxiv_id":"1711.02281","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["salesforce/nonauto-nmt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/non-autoregressive-neural-machine-translation-1#ran","syntology_url":"https://syntology.ai/paper/1711.02281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02281"}}}},{"paper":"/paper/weighted-transformer-network-for-machine","slug":"weighted-transformer-network-for-machine","title":"Weighted Transformer Network for Machine Translation","date":"2017-11-06","arxiv_id":"1711.02132","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/weighted-transformer-network-for-machine#ran","syntology_url":"https://syntology.ai/paper/1711.02132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02132"}}}},{"paper":"/paper/unsupervised-neural-machine-translation","slug":"unsupervised-neural-machine-translation","title":"Unsupervised Neural Machine Translation","date":"2017-10-30","arxiv_id":"1710.11041","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":6,"official":{"repos":["artetxem/undreamt","rsennrich/subword-nmt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-neural-machine-translation#ran","syntology_url":"https://syntology.ai/paper/1710.11041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11041"}}}},{"paper":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["asappresearch/sru"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-recurrent-units-for-highly#ran","syntology_url":"https://syntology.ai/paper/1709.02755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.02755"}}}},{"paper":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","rows_on_this_dataset":4,"code_links":595,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":946,"samples_ran":610,"samples_constructed":293,"samples_ran_checked":529,"samples_ran_instrument_failed":81,"samples_unverified":336,"pointer_only_for_licence":451,"official":{"repos":["tensorflow/tensor2tensor"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"paper":"/paper/depthwise-separable-convolutions-for-neural","slug":"depthwise-separable-convolutions-for-neural","title":"Depthwise Separable Convolutions for Neural Machine Translation","date":"2017-06-09","arxiv_id":"1706.03059","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/convolutional-sequence-to-sequence-learning","slug":"convolutional-sequence-to-sequence-learning","title":"Convolutional Sequence to Sequence Learning","date":"2017-05-08","arxiv_id":"1705.03122","rows_on_this_dataset":4,"code_links":37,"syntology":null},{"paper":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":6,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}}}},{"paper":"/paper/a-convolutional-encoder-model-for-neural","slug":"a-convolutional-encoder-model-for-neural","title":"A Convolutional Encoder Model for Neural Machine Translation","date":"2016-11-07","arxiv_id":"1611.02344","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/neural-machine-translation-in-linear-time","slug":"neural-machine-translation-in-linear-time","title":"Neural Machine Translation in Linear Time","date":"2016-10-31","arxiv_id":"1610.10099","rows_on_this_dataset":1,"code_links":11,"syntology":null},{"paper":"/paper/can-active-memory-replace-attention","slug":"can-active-memory-replace-attention","title":"Can Active Memory Replace Attention?","date":"2016-10-27","arxiv_id":"1610.08613","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/googles-neural-machine-translation-system","slug":"googles-neural-machine-translation-system","title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","date":"2016-09-26","arxiv_id":"1609.08144","rows_on_this_dataset":2,"code_links":28,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":46,"samples_ran":34,"samples_constructed":4,"samples_ran_checked":25,"samples_ran_instrument_failed":9,"samples_unverified":12,"pointer_only_for_licence":13,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/googles-neural-machine-translation-system#ran","syntology_url":"https://syntology.ai/paper/1609.08144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.08144"}}}},{"paper":"/paper/neural-semantic-encoders","slug":"neural-semantic-encoders","title":"Neural Semantic Encoders","date":"2016-07-14","arxiv_id":"1607.04315","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/sequence-level-knowledge-distillation","slug":"sequence-level-knowledge-distillation","title":"Sequence-Level Knowledge Distillation","date":"2016-06-25","arxiv_id":"1606.07947","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["harvardnlp/nmt-android","harvardnlp/seq2seq-attn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sequence-level-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/1606.07947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07947"}}}},{"paper":"/paper/deep-recurrent-models-with-fast-forward","slug":"deep-recurrent-models-with-fast-forward","title":"Deep Recurrent Models with Fast-Forward Connections for Neural Machine Translation","date":"2016-06-14","arxiv_id":"1606.04199","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/edinburghs-syntax-based-systems-at-wmt-2015","slug":"edinburghs-syntax-based-systems-at-wmt-2015","title":"Edinburgh's Syntax-Based Systems at WMT 2015","date":"2015-09-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/effective-approaches-to-attention-based","slug":"effective-approaches-to-attention-based","title":"Effective Approaches to Attention-based Neural Machine Translation","date":"2015-08-17","arxiv_id":"1508.04025","rows_on_this_dataset":3,"code_links":44,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/effective-approaches-to-attention-based#ran","syntology_url":"https://syntology.ai/paper/1508.04025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.04025"}}}},{"paper":"/paper/addressing-the-rare-word-problem-in-neural","slug":"addressing-the-rare-word-problem-in-neural","title":"Addressing the Rare Word Problem in Neural Machine Translation","date":"2014-10-30","arxiv_id":"1410.8206","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/sequence-to-sequence-learning-with-neural","slug":"sequence-to-sequence-learning-with-neural","title":"Sequence to Sequence Learning with Neural Networks","date":"2014-09-10","arxiv_id":"1409.3215","rows_on_this_dataset":2,"code_links":74,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":8,"samples_unverified":4,"pointer_only_for_licence":9,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sequence-to-sequence-learning-with-neural#ran","syntology_url":"https://syntology.ai/paper/1409.3215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.3215"}}}},{"paper":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["wojzaremba/lstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-neural-network-regularization#ran","syntology_url":"https://syntology.ai/paper/1409.2329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.2329"}}}},{"paper":"/paper/neural-machine-translation-by-jointly","slug":"neural-machine-translation-by-jointly","title":"Neural Machine Translation by Jointly Learning to Align and Translate","date":"2014-09-01","arxiv_id":"1409.0473","rows_on_this_dataset":1,"code_links":124,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":44,"samples_ran":41,"samples_constructed":2,"samples_ran_checked":24,"samples_ran_instrument_failed":17,"samples_unverified":3,"pointer_only_for_licence":16,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-machine-translation-by-jointly#ran","syntology_url":"https://syntology.ai/paper/1409.0473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.0473"}}}},{"paper":"/paper/learning-phrase-representations-using-rnn","slug":"learning-phrase-representations-using-rnn","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","date":"2014-06-03","arxiv_id":"1406.1078","rows_on_this_dataset":1,"code_links":42,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":13,"samples_constructed":6,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":9,"pointer_only_for_licence":14,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-phrase-representations-using-rnn#ran","syntology_url":"https://syntology.ai/paper/1406.1078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.1078"}}}}],"papers_where_code_ran":40,"papers_where_code_ran_first_page":"/dataset/wmt-2014/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/wmt-2014/papers/ran/1","json":"/dataset/wmt-2014/papers/ran/1.json","rows":40}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":42,"samples_harvested":1394,"samples_ran":929,"samples_constructed":346,"samples_ran_checked":752,"samples_ran_instrument_failed":177,"samples_unverified":465,"pointer_only_for_licence":601,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":40,"papers_with_a_run_with_no_instrument_failure":33,"papers_where_every_run_was_an_instrument_failure":7,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/machine-translation-on-wmt2014-german-english","since_archive":"/sota/machine-translation-on-wmt2014-german-english#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/unsupervised-machine-translation-on-wmt2014-3","since_archive":"/sota/unsupervised-machine-translation-on-wmt2014-3#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"867dfc9fd6f6e6583e1815a4416073bb4d0ac6cb43748fdaa348d8e0fcf5f0a5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}