{"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":"/task/machine-translation/papers/ran/5","list_of":"/task/machine-translation","task":"Machine Translation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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'","n_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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,477],"of":477,"counts":{"archive_papers_tagged":10752,"with_a_code_link":2444,"where_syntology_ran_a_sample":477,"not_listed_spam_title":0,"listed":10752,"listed_where_code_ran":477,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":381,"every_run_a_failure_of_syntologys_instrument":96,"listed_with_a_run_with_no_instrument_failure":381,"listed_every_run_a_failure_of_syntologys_instrument":96,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/machine-translation/papers/ran/1","prev":"/task/machine-translation/papers/ran/4","next":null,"papers":[{"url":"/paper/fixup-initialization-residual-learning","slug":"fixup-initialization-residual-learning","title":"Fixup Initialization: Residual Learning Without Normalization","date":"2019-01-27","arxiv_id":"1901.09321","repositories_listed":10,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fixup-initialization-residual-learning#ran","syntology_url":"https://syntology.ai/paper/1901.09321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09321"}},"official":null}},{"url":"/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","repositories_listed":17,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","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"}},"official":null}},{"url":"/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","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","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"}},"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"]}}},{"url":"/paper/neural-abstractive-text-summarization-with","slug":"neural-abstractive-text-summarization-with","title":"Neural Abstractive Text Summarization with Sequence-to-Sequence Models","date":"2018-12-05","arxiv_id":"1812.02303","repositories_listed":5,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-abstractive-text-summarization-with#ran","syntology_url":"https://syntology.ai/paper/1812.02303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.02303"}},"official":{"repos":["tshi04/NATS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/stochastic-gradient-push-for-distributed-deep","slug":"stochastic-gradient-push-for-distributed-deep","title":"Stochastic Gradient Push for Distributed Deep Learning","date":"2018-11-27","arxiv_id":"1811.10792","repositories_listed":3,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/stochastic-gradient-push-for-distributed-deep#ran","syntology_url":"https://syntology.ai/paper/1811.10792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.10792"}},"official":null}},{"url":"/paper/gpipe-efficient-training-of-giant-neural","slug":"gpipe-efficient-training-of-giant-neural","title":"GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism","date":"2018-11-16","arxiv_id":"1811.06965","repositories_listed":13,"syntology":{"n":25,"n_ran":20,"n_constructed":0,"n_ran_checked":19,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":16,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/gpipe-efficient-training-of-giant-neural#ran","syntology_url":"https://syntology.ai/paper/1811.06965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06965"}},"official":null}},{"url":"/paper/prior-knowledge-integration-for-neural","slug":"prior-knowledge-integration-for-neural","title":"Prior Knowledge Integration for Neural Machine Translation using Posterior Regularization","date":"2018-11-02","arxiv_id":"1811.01100","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/prior-knowledge-integration-for-neural#ran","syntology_url":"https://syntology.ai/paper/1811.01100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01100"}},"official":{"repos":["Glaceon31/PR4NMT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/texar-a-modularized-versatile-and-extensible-1","slug":"texar-a-modularized-versatile-and-extensible-1","title":"Texar: A Modularized, Versatile, and Extensible Toolkit for Text Generation","date":"2018-09-04","arxiv_id":"1809.00794","repositories_listed":4,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/texar-a-modularized-versatile-and-extensible-1#ran","syntology_url":"https://syntology.ai/paper/1809.00794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00794"}},"official":{"repos":["asyml/texar"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mtnt-a-testbed-for-machine-translation-of","slug":"mtnt-a-testbed-for-machine-translation-of","title":"MTNT: A Testbed for Machine Translation of Noisy Text","date":"2018-09-02","arxiv_id":"1809.00388","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mtnt-a-testbed-for-machine-translation-of#ran","syntology_url":"https://syntology.ai/paper/1809.00388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00388"}},"official":{"repos":["pmichel31415/mtnt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simple-fusion-return-of-the-language-model","slug":"simple-fusion-return-of-the-language-model","title":"Simple Fusion: Return of the Language Model","date":"2018-09-01","arxiv_id":"1809.00125","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/simple-fusion-return-of-the-language-model#ran","syntology_url":"https://syntology.ai/paper/1809.00125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00125"}},"official":null}},{"url":"/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","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/a-study-of-reinforcement-learning-for-neural","slug":"a-study-of-reinforcement-learning-for-neural","title":"A Study of Reinforcement Learning for Neural Machine Translation","date":"2018-08-27","arxiv_id":"1808.08866","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-study-of-reinforcement-learning-for-neural#ran","syntology_url":"https://syntology.ai/paper/1808.08866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08866"}},"official":{"repos":["apeterswu/RL4NMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-autoregressive-neural-machine","slug":"semi-autoregressive-neural-machine","title":"Semi-Autoregressive Neural Machine Translation","date":"2018-08-26","arxiv_id":"1808.08583","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/semi-autoregressive-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1808.08583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08583"}},"official":{"repos":["chqiwang/sa-nmt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-alignment-and-variational-attention","slug":"latent-alignment-and-variational-attention","title":"Latent Alignment and Variational Attention","date":"2018-07-10","arxiv_id":"1807.03756","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-alignment-and-variational-attention#ran","syntology_url":"https://syntology.ai/paper/1807.03756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03756"}},"official":{"repos":["harvardnlp/var-attn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-transformers","slug":"universal-transformers","title":"Universal Transformers","date":"2018-07-10","arxiv_id":"1807.03819","repositories_listed":8,"syntology":{"n":25,"n_ran":17,"n_constructed":8,"n_ran_checked":17,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":16,"n_pointer_only":24,"phrase":"17 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/universal-transformers#ran","syntology_url":"https://syntology.ai/paper/1807.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03819"}},"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"]}}},{"url":"/paper/graph-to-sequence-learning-using-gated-graph","slug":"graph-to-sequence-learning-using-gated-graph","title":"Graph-to-Sequence Learning using Gated Graph Neural Networks","date":"2018-06-26","arxiv_id":"1806.09835","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-to-sequence-learning-using-gated-graph#ran","syntology_url":"https://syntology.ai/paper/1806.09835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09835"}},"official":{"repos":["beckdaniel/acl2018_graph2seq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-natural-language-decathlon-multitask","slug":"the-natural-language-decathlon-multitask","title":"The Natural Language Decathlon: Multitask Learning as Question Answering","date":"2018-06-20","arxiv_id":"1806.08730","repositories_listed":6,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-natural-language-decathlon-multitask#ran","syntology_url":"https://syntology.ai/paper/1806.08730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08730"}},"official":{"repos":["salesforce/decaNLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/natural-language-generation-for-electronic","slug":"natural-language-generation-for-electronic","title":"Natural Language Generation for Electronic Health Records","date":"2018-06-01","arxiv_id":"1806.01353","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/natural-language-generation-for-electronic#ran","syntology_url":"https://syntology.ai/paper/1806.01353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01353"}},"official":{"repos":["scotthlee/nrc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-under-privileged-information","slug":"deep-learning-under-privileged-information","title":"Deep Learning under Privileged Information Using Heteroscedastic Dropout","date":"2018-05-29","arxiv_id":"1805.11614","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-learning-under-privileged-information#ran","syntology_url":"https://syntology.ai/paper/1805.11614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11614"}},"official":{"repos":["johnwlambert/dlupi-heteroscedastic-dropout"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/opennmt-neural-machine-translation-toolkit","slug":"opennmt-neural-machine-translation-toolkit","title":"OpenNMT: Neural Machine Translation Toolkit","date":"2018-05-28","arxiv_id":"1805.11462","repositories_listed":9,"syntology":{"n":29,"n_ran":20,"n_constructed":0,"n_ran_checked":20,"n_instrument":0,"n_unverified":9,"n_honours":1,"n_violates":1,"n_no_contract":18,"n_pointer_only":1,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 1 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/opennmt-neural-machine-translation-toolkit#ran","syntology_url":"https://syntology.ai/paper/1805.11462","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11462"}},"official":{"repos":["rsennrich/nematus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reliability-and-learnability-of-human-bandit","slug":"reliability-and-learnability-of-human-bandit","title":"Reliability and Learnability of Human Bandit Feedback for Sequence-to-Sequence Reinforcement Learning","date":"2018-05-27","arxiv_id":"1805.10627","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/reliability-and-learnability-of-human-bandit#ran","syntology_url":"https://syntology.ai/paper/1805.10627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10627"}},"official":null}},{"url":"/paper/deep-reinforcement-learning-for-sequence-to","slug":"deep-reinforcement-learning-for-sequence-to","title":"Deep Reinforcement Learning For Sequence to Sequence Models","date":"2018-05-24","arxiv_id":"1805.09461","repositories_listed":3,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-reinforcement-learning-for-sequence-to#ran","syntology_url":"https://syntology.ai/paper/1805.09461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09461"}},"official":{"repos":["yaserkl/RLSeq2Seq"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sparse-and-constrained-attention-for-neural","slug":"sparse-and-constrained-attention-for-neural","title":"Sparse and Constrained Attention for Neural Machine Translation","date":"2018-05-21","arxiv_id":"1805.08241","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sparse-and-constrained-attention-for-neural#ran","syntology_url":"https://syntology.ai/paper/1805.08241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08241"}},"official":null}},{"url":"/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","repositories_listed":1,"syntology":{"n":19,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","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"}},"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"]}}},{"url":"/paper/a-call-for-clarity-in-reporting-bleu-scores","slug":"a-call-for-clarity-in-reporting-bleu-scores","title":"A Call for Clarity in Reporting BLEU Scores","date":"2018-04-23","arxiv_id":"1804.08771","repositories_listed":2,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-call-for-clarity-in-reporting-bleu-scores#ran","syntology_url":"https://syntology.ai/paper/1804.08771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.08771"}},"official":null}},{"url":"/paper/qanet-combining-local-convolution-with-global","slug":"qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","arxiv_id":"1804.09541","repositories_listed":15,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qanet-combining-local-convolution-with-global#ran","syntology_url":"https://syntology.ai/paper/1804.09541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09541"}},"official":null}},{"url":"/paper/adafactor-adaptive-learning-rates-with","slug":"adafactor-adaptive-learning-rates-with","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","date":"2018-04-11","arxiv_id":"1804.04235","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adafactor-adaptive-learning-rates-with#ran","syntology_url":"https://syntology.ai/paper/1804.04235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04235"}},"official":null}},{"url":"/paper/demystifying-differentiable-programming","slug":"demystifying-differentiable-programming","title":"Demystifying Differentiable Programming: Shift/Reset the Penultimate Backpropagator","date":"2018-03-27","arxiv_id":"1803.10228","repositories_listed":1,"syntology":{"n":14,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/demystifying-differentiable-programming#ran","syntology_url":"https://syntology.ai/paper/1803.10228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10228"}},"official":{"repos":["feiwang3311/Lantern"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor2tensor-for-neural-machine-translation","slug":"tensor2tensor-for-neural-machine-translation","title":"Tensor2Tensor for Neural Machine Translation","date":"2018-03-16","arxiv_id":"1803.07416","repositories_listed":15,"syntology":{"n":48,"n_ran":30,"n_constructed":0,"n_ran_checked":29,"n_instrument":1,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":29,"n_pointer_only":0,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 29 with no instrument failure: 0 honoured, 0 violated, 29 with no contract checked; 1 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/tensor2tensor-for-neural-machine-translation#ran","syntology_url":"https://syntology.ai/paper/1803.07416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07416"}},"official":{"repos":["tensorflow/tensor2tensor"],"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"]}}},{"url":"/paper/achieving-human-parity-on-automatic-chinese","slug":"achieving-human-parity-on-automatic-chinese","title":"Achieving Human Parity on Automatic Chinese to English News Translation","date":"2018-03-15","arxiv_id":"1803.05567","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 2 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/achieving-human-parity-on-automatic-chinese#ran","syntology_url":"https://syntology.ai/paper/1803.05567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05567"}},"official":{"repos":["cfedermann/Appraise"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-k-nearest-neighbors-towards-confident","slug":"deep-k-nearest-neighbors-towards-confident","title":"Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learning","date":"2018-03-13","arxiv_id":"1803.04765","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-k-nearest-neighbors-towards-confident#ran","syntology_url":"https://syntology.ai/paper/1803.04765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04765"}},"official":null}},{"url":"/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","repositories_listed":13,"syntology":{"n":23,"n_ran":13,"n_constructed":4,"n_ran_checked":8,"n_instrument":5,"n_unverified":10,"n_honours":2,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","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"}},"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"]}}},{"url":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","repositories_listed":35,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}},"official":{"repos":["locuslab/TCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/seq2sick-evaluating-the-robustness-of","slug":"seq2sick-evaluating-the-robustness-of","title":"Seq2Sick: Evaluating the Robustness of Sequence-to-Sequence Models with Adversarial Examples","date":"2018-03-03","arxiv_id":"1803.01128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/seq2sick-evaluating-the-robustness-of#ran","syntology_url":"https://syntology.ai/paper/1803.01128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01128"}},"official":{"repos":["cmhcbb/Seq2Sick"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/multimodal-generative-models-for-scalable","slug":"multimodal-generative-models-for-scalable","title":"Multimodal Generative Models for Scalable Weakly-Supervised Learning","date":"2018-02-14","arxiv_id":"1802.05335","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-generative-models-for-scalable#ran","syntology_url":"https://syntology.ai/paper/1802.05335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05335"}},"official":null}},{"url":"/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","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/synthetic-and-natural-noise-both-break-neural","slug":"synthetic-and-natural-noise-both-break-neural","title":"Synthetic and Natural Noise Both Break Neural Machine Translation","date":"2017-11-06","arxiv_id":"1711.02173","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/synthetic-and-natural-noise-both-break-neural#ran","syntology_url":"https://syntology.ai/paper/1711.02173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02173"}},"official":{"repos":["ybisk/charNMT-noise"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-machine-translation-using","slug":"unsupervised-machine-translation-using","title":"Unsupervised Machine Translation Using Monolingual Corpora Only","date":"2017-10-31","arxiv_id":"1711.00043","repositories_listed":14,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":5,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/unsupervised-machine-translation-using#ran","syntology_url":"https://syntology.ai/paper/1711.00043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.00043"}},"official":null}},{"url":"/paper/unsupervised-neural-machine-translation","slug":"unsupervised-neural-machine-translation","title":"Unsupervised Neural Machine Translation","date":"2017-10-30","arxiv_id":"1710.11041","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/word-translation-without-parallel-data","slug":"word-translation-without-parallel-data","title":"Word Translation Without Parallel Data","date":"2017-10-11","arxiv_id":"1710.04087","repositories_listed":20,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/word-translation-without-parallel-data#ran","syntology_url":"https://syntology.ai/paper/1710.04087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.04087"}},"official":{"repos":["facebookresearch/MUSE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improving-lexical-choice-in-neural-machine","slug":"improving-lexical-choice-in-neural-machine","title":"Improving Lexical Choice in Neural Machine Translation","date":"2017-10-03","arxiv_id":"1710.01329","repositories_listed":4,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/improving-lexical-choice-in-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1710.01329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.01329"}},"official":{"repos":["tnq177/improving_lexical_choice_in_nmt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":11,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/cross-lingual-entity-alignment-via-joint","slug":"cross-lingual-entity-alignment-via-joint","title":"Cross-lingual Entity Alignment via Joint Attribute-Preserving Embedding","date":"2017-08-16","arxiv_id":"1708.05045","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cross-lingual-entity-alignment-via-joint#ran","syntology_url":"https://syntology.ai/paper/1708.05045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.05045"}},"official":{"repos":["nju-websoft/JAPE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-data-selection-for-neural-machine","slug":"dynamic-data-selection-for-neural-machine","title":"Dynamic Data Selection for Neural Machine Translation","date":"2017-08-02","arxiv_id":"1708.00712","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-data-selection-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1708.00712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00712"}},"official":{"repos":["marliesvanderwees/dds-nmt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learned-in-translation-contextualized-word","slug":"learned-in-translation-contextualized-word","title":"Learned in Translation: Contextualized Word Vectors","date":"2017-08-01","arxiv_id":"1708.00107","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learned-in-translation-contextualized-word#ran","syntology_url":"https://syntology.ai/paper/1708.00107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00107"}},"official":{"repos":["salesforce/cove"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-parallel-corpus-of-python-functions-and","slug":"a-parallel-corpus-of-python-functions-and","title":"A parallel corpus of Python functions and documentation strings for automated code documentation and code generation","date":"2017-07-07","arxiv_id":"1707.02275","repositories_listed":6,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-parallel-corpus-of-python-functions-and#ran","syntology_url":"https://syntology.ai/paper/1707.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.02275"}},"official":{"repos":["Avmb/code-docstring-corpus"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/relevance-of-unsupervised-metrics-in-task","slug":"relevance-of-unsupervised-metrics-in-task","title":"Relevance of Unsupervised Metrics in Task-Oriented Dialogue for Evaluating Natural Language Generation","date":"2017-06-29","arxiv_id":"1706.09799","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relevance-of-unsupervised-metrics-in-task#ran","syntology_url":"https://syntology.ai/paper/1706.09799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.09799"}},"official":{"repos":["Maluuba/nlg-eval"],"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":["official"]}}},{"url":"/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","repositories_listed":595,"syntology":{"n":946,"n_ran":610,"n_constructed":293,"n_ran_checked":529,"n_instrument":81,"n_unverified":336,"n_honours":45,"n_violates":15,"n_no_contract":469,"n_pointer_only":451,"phrase":"610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified","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"}},"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"]}}},{"url":"/paper/style-transfer-from-non-parallel-text-by","slug":"style-transfer-from-non-parallel-text-by","title":"Style Transfer from Non-Parallel Text by Cross-Alignment","date":"2017-05-26","arxiv_id":"1705.09655","repositories_listed":12,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/style-transfer-from-non-parallel-text-by#ran","syntology_url":"https://syntology.ai/paper/1705.09655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.09655"}},"official":{"repos":["shentianxiao/language-style-transfer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/lexically-constrained-decoding-for-sequence","slug":"lexically-constrained-decoding-for-sequence","title":"Lexically Constrained Decoding for Sequence Generation Using Grid Beam Search","date":"2017-04-24","arxiv_id":"1704.07138","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lexically-constrained-decoding-for-sequence#ran","syntology_url":"https://syntology.ai/paper/1704.07138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.07138"}},"official":{"repos":["chrishokamp/constrained_decoding"],"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":["official"]}}},{"url":"/paper/improving-neural-machine-translation-with","slug":"improving-neural-machine-translation-with","title":"Improving Neural Machine Translation with Conditional Sequence Generative Adversarial Nets","date":"2017-03-15","arxiv_id":"1703.04887","repositories_listed":3,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/improving-neural-machine-translation-with#ran","syntology_url":"https://syntology.ai/paper/1703.04887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04887"}},"official":{"repos":["ZhenYangIACAS/NMT_GAN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/massive-exploration-of-neural-machine","slug":"massive-exploration-of-neural-machine","title":"Massive Exploration of Neural Machine Translation Architectures","date":"2017-03-11","arxiv_id":"1703.03906","repositories_listed":12,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/massive-exploration-of-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1703.03906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03906"}},"official":{"repos":["google/seq2seq"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/trainable-greedy-decoding-for-neural-machine","slug":"trainable-greedy-decoding-for-neural-machine","title":"Trainable Greedy Decoding for Neural Machine Translation","date":"2017-02-08","arxiv_id":"1702.02429","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/trainable-greedy-decoding-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1702.02429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02429"}},"official":null}},{"url":"/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","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","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"}},"official":null}},{"url":"/paper/quasi-recurrent-neural-networks","slug":"quasi-recurrent-neural-networks","title":"Quasi-Recurrent Neural Networks","date":"2016-11-05","arxiv_id":"1611.01576","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quasi-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1611.01576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01576"}},"official":null}},{"url":"/paper/fully-character-level-neural-machine","slug":"fully-character-level-neural-machine","title":"Fully Character-Level Neural Machine Translation without Explicit Segmentation","date":"2016-10-10","arxiv_id":"1610.03017","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fully-character-level-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1610.03017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.03017"}},"official":{"repos":["nyu-dl/dl4mt-c2c"],"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":["official"]}}},{"url":"/paper/diverse-beam-search-decoding-diverse","slug":"diverse-beam-search-decoding-diverse","title":"Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Models","date":"2016-10-07","arxiv_id":"1610.02424","repositories_listed":25,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":14,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/diverse-beam-search-decoding-diverse#ran","syntology_url":"https://syntology.ai/paper/1610.02424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.02424"}},"official":{"repos":["ashwinkalyan/dbs"],"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"]}}},{"url":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","repositories_listed":10,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hypernetworks#ran","syntology_url":"https://syntology.ai/paper/1609.09106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09106"}},"official":null}},{"url":"/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","repositories_listed":28,"syntology":{"n":46,"n_ran":34,"n_constructed":4,"n_ran_checked":26,"n_instrument":8,"n_unverified":12,"n_honours":1,"n_violates":2,"n_no_contract":23,"n_pointer_only":13,"phrase":"34 ran (of which 4 constructed an object rather than computing a result; 26 with no instrument failure: 1 honoured, 2 violated, 23 with no contract checked; 8 where Syntology's instrument failed) · 12 unverified","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"}},"official":null}},{"url":"/paper/context-gates-for-neural-machine-translation","slug":"context-gates-for-neural-machine-translation","title":"Context Gates for Neural Machine Translation","date":"2016-08-22","arxiv_id":"1608.06043","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/context-gates-for-neural-machine-translation#ran","syntology_url":"https://syntology.ai/paper/1608.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.06043"}},"official":{"repos":["tuzhaopeng/nmt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/sequence-level-knowledge-distillation","slug":"sequence-level-knowledge-distillation","title":"Sequence-Level Knowledge Distillation","date":"2016-06-25","arxiv_id":"1606.07947","repositories_listed":6,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/3d-u-net-learning-dense-volumetric","slug":"3d-u-net-learning-dense-volumetric","title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","date":"2016-06-21","arxiv_id":"1606.06650","repositories_listed":27,"syntology":{"n":76,"n_ran":59,"n_constructed":18,"n_ran_checked":42,"n_instrument":17,"n_unverified":17,"n_honours":4,"n_violates":0,"n_no_contract":38,"n_pointer_only":20,"phrase":"59 ran (of which 18 constructed an object rather than computing a result; 42 with no instrument failure: 4 honoured, 0 violated, 38 with no contract checked; 17 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/3d-u-net-learning-dense-volumetric#ran","syntology_url":"https://syntology.ai/paper/1606.06650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.06650"}},"official":null}},{"url":"/paper/edinburgh-neural-machine-translation-systems","slug":"edinburgh-neural-machine-translation-systems","title":"Edinburgh Neural Machine Translation Systems for WMT 16","date":"2016-06-09","arxiv_id":"1606.02891","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/edinburgh-neural-machine-translation-systems#ran","syntology_url":"https://syntology.ai/paper/1606.02891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02891"}},"official":{"repos":["rsennrich/wmt16-scripts"],"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":["official"]}}},{"url":"/paper/sequence-to-sequence-learning-as-beam-search","slug":"sequence-to-sequence-learning-as-beam-search","title":"Sequence-to-Sequence Learning as Beam-Search Optimization","date":"2016-06-09","arxiv_id":"1606.02960","repositories_listed":6,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-to-sequence-learning-as-beam-search#ran","syntology_url":"https://syntology.ai/paper/1606.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02960"}},"official":{"repos":["harvardnlp/BSO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/achieving-open-vocabulary-neural-machine","slug":"achieving-open-vocabulary-neural-machine","title":"Achieving Open Vocabulary Neural Machine Translation with Hybrid Word-Character Models","date":"2016-04-04","arxiv_id":"1604.00788","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/achieving-open-vocabulary-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1604.00788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.00788"}},"official":null}},{"url":"/paper/a-character-level-decoder-without-explicit","slug":"a-character-level-decoder-without-explicit","title":"A Character-Level Decoder without Explicit Segmentation for Neural Machine Translation","date":"2016-03-19","arxiv_id":"1603.06147","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-character-level-decoder-without-explicit#ran","syntology_url":"https://syntology.ai/paper/1603.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.06147"}},"official":null}},{"url":"/paper/modeling-coverage-for-neural-machine","slug":"modeling-coverage-for-neural-machine","title":"Modeling Coverage for Neural Machine Translation","date":"2016-01-19","arxiv_id":"1601.04811","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-coverage-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1601.04811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.04811"}},"official":{"repos":["tuzhaopeng/NMT-Coverage"],"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"]}}},{"url":"/paper/improving-neural-machine-translation-models","slug":"improving-neural-machine-translation-models","title":"Improving Neural Machine Translation Models with Monolingual Data","date":"2015-11-20","arxiv_id":"1511.06709","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-neural-machine-translation-models#ran","syntology_url":"https://syntology.ai/paper/1511.06709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06709"}},"official":null}},{"url":"/paper/neural-machine-translation-of-rare-words-with","slug":"neural-machine-translation-of-rare-words-with","title":"Neural Machine Translation of Rare Words with Subword Units","date":"2015-08-31","arxiv_id":"1508.07909","repositories_listed":26,"syntology":{"n":30,"n_ran":21,"n_constructed":0,"n_ran_checked":1,"n_instrument":20,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":21,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 20 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/neural-machine-translation-of-rare-words-with#ran","syntology_url":"https://syntology.ai/paper/1508.07909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.07909"}},"official":{"repos":["rsennrich/subword-nmt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":44,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","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"}},"official":null}},{"url":"/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","repositories_listed":74,"syntology":{"n":25,"n_ran":21,"n_constructed":0,"n_ran_checked":13,"n_instrument":8,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":10,"n_pointer_only":9,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 0 violated, 10 with no contract checked; 8 where Syntology's instrument failed) · 4 unverified","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"}},"official":null}},{"url":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","repositories_listed":21,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":124,"syntology":{"n":44,"n_ran":41,"n_constructed":2,"n_ran_checked":24,"n_instrument":17,"n_unverified":3,"n_honours":4,"n_violates":0,"n_no_contract":20,"n_pointer_only":16,"phrase":"41 ran (of which 2 constructed an object rather than computing a result; 24 with no instrument failure: 4 honoured, 0 violated, 20 with no contract checked; 17 where Syntology's instrument failed) · 3 unverified","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"}},"official":null}},{"url":"/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","repositories_listed":42,"syntology":{"n":22,"n_ran":13,"n_constructed":6,"n_ran_checked":10,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":14,"phrase":"13 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","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"}},"official":null}},{"url":"/paper/sequence-transduction-with-recurrent-neural","slug":"sequence-transduction-with-recurrent-neural","title":"Sequence Transduction with Recurrent Neural Networks","date":"2012-11-14","arxiv_id":"1211.3711","repositories_listed":7,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sequence-transduction-with-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1211.3711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1211.3711"}},"official":null}}],"record_sha256":"36af24da61b4f0ebacd1a0a1b6e1ea6f2a2c5145e40420ec9f41f550d79d62c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}