{"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/translation/papers/ran/5","list_of":"/task/translation","task":"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":7,"rows_per_page":100,"rows":[401,500],"of":682,"counts":{"archive_papers_tagged":12395,"with_a_code_link":3574,"where_syntology_ran_a_sample":682,"not_listed_spam_title":0,"listed":12395,"listed_where_code_ran":682,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":566,"every_run_a_failure_of_syntologys_instrument":116,"listed_with_a_run_with_no_instrument_failure":566,"listed_every_run_a_failure_of_syntologys_instrument":116,"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/translation/papers/ran/1","prev":"/task/translation/papers/ran/4","next":"/task/translation/papers/ran/6","papers":[{"url":"/paper/text-generation-by-learning-from-off-policy","slug":"text-generation-by-learning-from-off-policy","title":"Text Generation by Learning from Demonstrations","date":"2020-09-16","arxiv_id":"2009.07839","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/text-generation-by-learning-from-off-policy#ran","syntology_url":"https://syntology.ai/paper/2009.07839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.07839"}},"official":{"repos":["yzpang/gold-off-policy-text-gen-iclr21"],"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":["found_in_text"]}}},{"url":"/paper/filter-an-enhanced-fusion-method-for-cross","slug":"filter-an-enhanced-fusion-method-for-cross","title":"FILTER: An Enhanced Fusion Method for Cross-lingual Language Understanding","date":"2020-09-10","arxiv_id":"2009.05166","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/filter-an-enhanced-fusion-method-for-cross#ran","syntology_url":"https://syntology.ai/paper/2009.05166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05166"}},"official":null}},{"url":"/paper/deep-cyclic-generative-adversarial-residual","slug":"deep-cyclic-generative-adversarial-residual","title":"Deep Cyclic Generative Adversarial Residual Convolutional Networks for Real Image Super-Resolution","date":"2020-09-07","arxiv_id":"2009.03693","repositories_listed":1,"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/deep-cyclic-generative-adversarial-residual#ran","syntology_url":"https://syntology.ai/paper/2009.03693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03693"}},"official":{"repos":["RaoUmer/SRResCycGAN"],"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"]}}},{"url":"/paper/patching-as-translation-the-data-and-the","slug":"patching-as-translation-the-data-and-the","title":"Patching as Translation: the Data and the Metaphor","date":"2020-08-24","arxiv_id":"2008.10707","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/patching-as-translation-the-data-and-the#ran","syntology_url":"https://syntology.ai/paper/2008.10707","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10707"}},"official":{"repos":["ARiSE-Lab/Patch-as-translation"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":4,"syntology":{"n":9,"n_ran":8,"n_constructed":2,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/paraphrase-generation-as-zero-shot","slug":"paraphrase-generation-as-zero-shot","title":"Paraphrase Generation as Zero-Shot Multilingual Translation: Disentangling Semantic Similarity from Lexical and Syntactic Diversity","date":"2020-08-11","arxiv_id":"2008.04935","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/paraphrase-generation-as-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2008.04935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.04935"}},"official":{"repos":["thompsonb/prism"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/delight-very-deep-and-light-weight","slug":"delight-very-deep-and-light-weight","title":"DeLighT: Deep and Light-weight Transformer","date":"2020-08-03","arxiv_id":"2008.00623","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/delight-very-deep-and-light-weight#ran","syntology_url":"https://syntology.ai/paper/2008.00623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00623"}},"official":{"repos":["sacmehta/delight"],"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":["official"]}}},{"url":"/paper/encoding-in-style-a-stylegan-encoder-for","slug":"encoding-in-style-a-stylegan-encoder-for","title":"Encoding in Style: a StyleGAN Encoder for Image-to-Image Translation","date":"2020-08-03","arxiv_id":"2008.00951","repositories_listed":10,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":13,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/encoding-in-style-a-stylegan-encoder-for#ran","syntology_url":"https://syntology.ai/paper/2008.00951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00951"}},"official":{"repos":["eladrich/pixel2style2pixel"],"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/multilingual-translation-with-extensible","slug":"multilingual-translation-with-extensible","title":"Multilingual Translation with Extensible Multilingual Pretraining and Finetuning","date":"2020-08-02","arxiv_id":"2008.00401","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/multilingual-translation-with-extensible#ran","syntology_url":"https://syntology.ai/paper/2008.00401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00401"}},"official":null}},{"url":"/paper/mkqa-a-linguistically-diverse-benchmark-for","slug":"mkqa-a-linguistically-diverse-benchmark-for","title":"MKQA: A Linguistically Diverse Benchmark for Multilingual Open Domain Question Answering","date":"2020-07-30","arxiv_id":"2007.15207","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/mkqa-a-linguistically-diverse-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2007.15207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15207"}},"official":{"repos":["apple/ml-mkqa"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-learning-for-unpaired-image-to","slug":"contrastive-learning-for-unpaired-image-to","title":"Contrastive Learning for Unpaired Image-to-Image Translation","date":"2020-07-30","arxiv_id":"2007.15651","repositories_listed":10,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-learning-for-unpaired-image-to#ran","syntology_url":"https://syntology.ai/paper/2007.15651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15651"}},"official":{"repos":["taesungp/contrastive-unpaired-translation"],"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/covost-2-a-massively-multilingual-speech-to","slug":"covost-2-a-massively-multilingual-speech-to","title":"CoVoST 2 and Massively Multilingual Speech-to-Text Translation","date":"2020-07-20","arxiv_id":"2007.10310","repositories_listed":2,"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/covost-2-a-massively-multilingual-speech-to#ran","syntology_url":"https://syntology.ai/paper/2007.10310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10310"}},"official":{"repos":["facebookresearch/covost"],"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/a-novel-graph-based-multi-modal-fusion-1","slug":"a-novel-graph-based-multi-modal-fusion-1","title":"A Novel Graph-based Multi-modal Fusion Encoder for Neural Machine Translation","date":"2020-07-17","arxiv_id":"2007.08742","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"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 2 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/a-novel-graph-based-multi-modal-fusion-1#ran","syntology_url":"https://syntology.ai/paper/2007.08742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08742"}},"official":{"repos":["middlekisser/GMNMT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scale-equivariance-improves-siamese-tracking","slug":"scale-equivariance-improves-siamese-tracking","title":"Scale Equivariance Improves Siamese Tracking","date":"2020-07-17","arxiv_id":"2007.09115","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/scale-equivariance-improves-siamese-tracking#ran","syntology_url":"https://syntology.ai/paper/2007.09115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09115"}},"official":{"repos":["isosnovik/SiamSE"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-multilingual-parallel-corpora-collection-1","slug":"a-multilingual-parallel-corpora-collection-1","title":"A Multilingual Parallel Corpora Collection Effort for Indian Languages","date":"2020-07-15","arxiv_id":"2007.07691","repositories_listed":2,"syntology":{"n":10,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"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) · 6 unverified","sample_list":"/paper/a-multilingual-parallel-corpora-collection-1#ran","syntology_url":"https://syntology.ai/paper/2007.07691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07691"}},"official":null}},{"url":"/paper/modeling-voting-for-system-combination-in","slug":"modeling-voting-for-system-combination-in","title":"Modeling Voting for System Combination in Machine Translation","date":"2020-07-14","arxiv_id":"2007.06943","repositories_listed":1,"syntology":{"n":19,"n_ran":9,"n_constructed":0,"n_ran_checked":0,"n_instrument":9,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 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; 9 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/modeling-voting-for-system-combination-in#ran","syntology_url":"https://syntology.ai/paper/2007.06943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06943"}},"official":{"repos":["THUNLP-MT/Voting4SC"],"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":["found_in_text"]}}},{"url":"/paper/learn-to-use-future-information-in","slug":"learn-to-use-future-information-in","title":"Temporally Correlated Task Scheduling for Sequence Learning","date":"2020-07-10","arxiv_id":"2007.05290","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learn-to-use-future-information-in#ran","syntology_url":"https://syntology.ai/paper/2007.05290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05290"}},"official":{"repos":["microsoft/qlib"],"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":["named_in_paper"]}}},{"url":"/paper/meta-learning-stationary-stochastic-process","slug":"meta-learning-stationary-stochastic-process","title":"Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processes","date":"2020-07-02","arxiv_id":"2007.01332","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/meta-learning-stationary-stochastic-process#ran","syntology_url":"https://syntology.ai/paper/2007.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01332"}},"official":{"repos":["YannDubs/Neural-Process-Family","wesselb/NeuralProcesses.jl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gshard-scaling-giant-models-with-conditional","slug":"gshard-scaling-giant-models-with-conditional","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","date":"2020-06-30","arxiv_id":"2006.16668","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":2,"n_ran_checked":4,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gshard-scaling-giant-models-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2006.16668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16668"}},"official":null}},{"url":"/paper/simplifying-models-with-unlabeled-output-data","slug":"simplifying-models-with-unlabeled-output-data","title":"Composed Fine-Tuning: Freezing Pre-Trained Denoising Autoencoders for Improved Generalization","date":"2020-06-29","arxiv_id":"2006.16205","repositories_listed":2,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simplifying-models-with-unlabeled-output-data#ran","syntology_url":"https://syntology.ai/paper/2006.16205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16205"}},"official":{"repos":["p-lambda/composed_finetuning","p-lambda/unlabeled_outputs"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-em-approach-to-non-autoregressive","slug":"an-em-approach-to-non-autoregressive","title":"An EM Approach to Non-autoregressive Conditional Sequence Generation","date":"2020-06-29","arxiv_id":"2006.16378","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/an-em-approach-to-non-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2006.16378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16378"}},"official":null}},{"url":"/paper/graph-optimal-transport-for-cross-domain","slug":"graph-optimal-transport-for-cross-domain","title":"Graph Optimal Transport for Cross-Domain Alignment","date":"2020-06-26","arxiv_id":"2006.14744","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":6,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-optimal-transport-for-cross-domain#ran","syntology_url":"https://syntology.ai/paper/2006.14744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14744"}},"official":{"repos":["LiqunChen0606/Graph-Optimal-Transport"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pre-training-via-paraphrasing","slug":"pre-training-via-paraphrasing","title":"Pre-training via Paraphrasing","date":"2020-06-26","arxiv_id":"2006.15020","repositories_listed":2,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":3,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pre-training-via-paraphrasing#ran","syntology_url":"https://syntology.ai/paper/2006.15020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15020"}},"official":null}},{"url":"/paper/a-loss-function-for-generative-neural","slug":"a-loss-function-for-generative-neural","title":"A Loss Function for Generative Neural Networks Based on Watson's Perceptual Model","date":"2020-06-26","arxiv_id":"2006.15057","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-loss-function-for-generative-neural#ran","syntology_url":"https://syntology.ai/paper/2006.15057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15057"}},"official":{"repos":["SteffenCzolbe/PerceptualSimilarity"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-high-quality-multilingual-dataset-for-1","slug":"a-high-quality-multilingual-dataset-for-1","title":"A High-Quality Multilingual Dataset for Structured Documentation Translation","date":"2020-06-24","arxiv_id":"2006.13425","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-high-quality-multilingual-dataset-for-1#ran","syntology_url":"https://syntology.ai/paper/2006.13425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13425"}},"official":null}},{"url":"/paper/multi-branch-attentive-transformer","slug":"multi-branch-attentive-transformer","title":"Multi-branch Attentive Transformer","date":"2020-06-18","arxiv_id":"2006.10270","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/deep-encoder-shallow-decoder-reevaluating-the","slug":"deep-encoder-shallow-decoder-reevaluating-the","title":"Deep Encoder, Shallow Decoder: Reevaluating Non-autoregressive Machine Translation","date":"2020-06-18","arxiv_id":"2006.10369","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/deep-encoder-shallow-decoder-reevaluating-the#ran","syntology_url":"https://syntology.ai/paper/2006.10369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10369"}},"official":{"repos":["jungokasai/deep-shallow"],"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":["listed","official"]}}},{"url":"/paper/se-3-transformers-3d-roto-translation","slug":"se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","arxiv_id":"2006.10503","repositories_listed":5,"syntology":{"n":28,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/se-3-transformers-3d-roto-translation#ran","syntology_url":"https://syntology.ai/paper/2006.10503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10503"}},"official":{"repos":["FabianFuchsML/se3-transformer-public"],"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/on-the-computational-power-of-transformers","slug":"on-the-computational-power-of-transformers","title":"On the Computational Power of Transformers and its Implications in Sequence Modeling","date":"2020-06-16","arxiv_id":"2006.09286","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":2,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-computational-power-of-transformers#ran","syntology_url":"https://syntology.ai/paper/2006.09286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09286"}},"official":{"repos":["satwik77/Transformer-Computation-Analysis"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autogan-distiller-searching-to-compress","slug":"autogan-distiller-searching-to-compress","title":"AutoGAN-Distiller: Searching to Compress Generative Adversarial Networks","date":"2020-06-15","arxiv_id":"2006.08198","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autogan-distiller-searching-to-compress#ran","syntology_url":"https://syntology.ai/paper/2006.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08198"}},"official":{"repos":["TAMU-VITA/AGD"],"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/dyne-dynamic-ensemble-decoding-for-multi","slug":"dyne-dynamic-ensemble-decoding-for-multi","title":"DynE: Dynamic Ensemble Decoding for Multi-Document Summarization","date":"2020-06-15","arxiv_id":"2006.08748","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/dyne-dynamic-ensemble-decoding-for-multi#ran","syntology_url":"https://syntology.ai/paper/2006.08748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08748"}},"official":{"repos":["chrishokamp/dynamic-transformer-ensembles"],"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/sparse-and-continuous-attention-mechanisms","slug":"sparse-and-continuous-attention-mechanisms","title":"Sparse and Continuous Attention Mechanisms","date":"2020-06-12","arxiv_id":"2006.07214","repositories_listed":2,"syntology":{"n":15,"n_ran":12,"n_constructed":9,"n_ran_checked":9,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"12 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sparse-and-continuous-attention-mechanisms#ran","syntology_url":"https://syntology.ai/paper/2006.07214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07214"}},"official":{"repos":["deep-spin/mcan-vqa-continuous-attention"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-recover-from-multi-modality","slug":"learning-to-recover-from-multi-modality","title":"Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine Translation","date":"2020-06-09","arxiv_id":"2006.05165","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/learning-to-recover-from-multi-modality#ran","syntology_url":"https://syntology.ai/paper/2006.05165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05165"}},"official":{"repos":["ranqiu92/RecoverSAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cyclegt-unsupervised-graph-to-text-and-text","slug":"cyclegt-unsupervised-graph-to-text-and-text","title":"CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training","date":"2020-06-08","arxiv_id":"2006.04702","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/cyclegt-unsupervised-graph-to-text-and-text#ran","syntology_url":"https://syntology.ai/paper/2006.04702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04702"}},"official":{"repos":["QipengGuo/CycleGT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-self-supervised-approach-for-adversarial-1","slug":"a-self-supervised-approach-for-adversarial-1","title":"A Self-supervised Approach for Adversarial Robustness","date":"2020-06-08","arxiv_id":"2006.04924","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-self-supervised-approach-for-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2006.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04924"}},"official":{"repos":["Muzammal-Naseer/NRP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/prediction-with-directed-transitions-complex","slug":"prediction-with-directed-transitions-complex","title":"Prediction and Generalisation over Directed Actions by Grid Cells","date":"2020-06-05","arxiv_id":"2006.03355","repositories_listed":1,"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":1,"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/prediction-with-directed-transitions-complex#ran","syntology_url":"https://syntology.ai/paper/2006.03355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03355"}},"official":null}},{"url":"/paper/unsupervised-translation-of-programming","slug":"unsupervised-translation-of-programming","title":"Unsupervised Translation of Programming Languages","date":"2020-06-05","arxiv_id":"2006.03511","repositories_listed":9,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-translation-of-programming#ran","syntology_url":"https://syntology.ai/paper/2006.03511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03511"}},"official":{"repos":["facebookresearch/CodeGen"],"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/cascaded-text-generation-with-markov","slug":"cascaded-text-generation-with-markov","title":"Cascaded Text Generation with Markov Transformers","date":"2020-06-01","arxiv_id":"2006.01112","repositories_listed":1,"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":1,"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/cascaded-text-generation-with-markov#ran","syntology_url":"https://syntology.ai/paper/2006.01112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.01112"}},"official":{"repos":["harvardnlp/cascaded-generation"],"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"]}}},{"url":"/paper/low-latency-sequence-to-sequence-speech","slug":"low-latency-sequence-to-sequence-speech","title":"Low-Latency Sequence-to-Sequence Speech Recognition and Translation by Partial Hypothesis Selection","date":"2020-05-22","arxiv_id":"2005.11185","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":0,"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/low-latency-sequence-to-sequence-speech#ran","syntology_url":"https://syntology.ai/paper/2005.11185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11185"}},"official":{"repos":["dannigt/NMTGMinor.lowLatency"],"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/simplify-then-translate-automatic","slug":"simplify-then-translate-automatic","title":"Simplify-then-Translate: Automatic Preprocessing for Black-Box Machine Translation","date":"2020-05-22","arxiv_id":"2005.11197","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/simplify-then-translate-automatic#ran","syntology_url":"https://syntology.ai/paper/2005.11197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11197"}},"official":null}},{"url":"/paper/efficient-wait-k-models-for-simultaneous","slug":"efficient-wait-k-models-for-simultaneous","title":"Efficient Wait-k Models for Simultaneous Machine Translation","date":"2020-05-18","arxiv_id":"2005.08595","repositories_listed":1,"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":1,"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/efficient-wait-k-models-for-simultaneous#ran","syntology_url":"https://syntology.ai/paper/2005.08595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08595"}},"official":{"repos":["elbayadm/attn2d"],"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"]}}},{"url":"/paper/learning-and-evaluating-emotion-lexicons-for","slug":"learning-and-evaluating-emotion-lexicons-for","title":"Learning and Evaluating Emotion Lexicons for 91 Languages","date":"2020-05-12","arxiv_id":"2005.05672","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/learning-and-evaluating-emotion-lexicons-for#ran","syntology_url":"https://syntology.ai/paper/2005.05672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05672"}},"official":{"repos":["JULIELab/MEmoLon"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/it-s-easier-to-translate-out-of-english-than","slug":"it-s-easier-to-translate-out-of-english-than","title":"It's Easier to Translate out of English than into it: Measuring Neural Translation Difficulty by Cross-Mutual Information","date":"2020-05-05","arxiv_id":"2005.02354","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/it-s-easier-to-translate-out-of-english-than#ran","syntology_url":"https://syntology.ai/paper/2005.02354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02354"}},"official":{"repos":["e-bug/nmt-difficulty"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/transforming-and-projecting-images-into-class","slug":"transforming-and-projecting-images-into-class","title":"Transforming and Projecting Images into Class-conditional Generative Networks","date":"2020-05-04","arxiv_id":"2005.01703","repositories_listed":2,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/transforming-and-projecting-images-into-class#ran","syntology_url":"https://syntology.ai/paper/2005.01703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01703"}},"official":{"repos":["minyoungg/pix2latent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-limitations-of-cross-lingual-encoders","slug":"on-the-limitations-of-cross-lingual-encoders","title":"On the Limitations of Cross-lingual Encoders as Exposed by Reference-Free Machine Translation Evaluation","date":"2020-05-03","arxiv_id":"2005.01196","repositories_listed":1,"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":1,"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/on-the-limitations-of-cross-lingual-encoders#ran","syntology_url":"https://syntology.ai/paper/2005.01196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01196"}},"official":{"repos":["AIPHES/ACL20-Reference-Free-MT-Evaluation"],"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","unlocated"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","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"}},"official":null}},{"url":"/paper/simulated-multiple-reference-training","slug":"simulated-multiple-reference-training","title":"Simulated Multiple Reference Training Improves Low-Resource Machine Translation","date":"2020-04-30","arxiv_id":"2004.14524","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/simulated-multiple-reference-training#ran","syntology_url":"https://syntology.ai/paper/2004.14524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14524"}},"official":null}},{"url":"/paper/bridging-linguistic-typology-and-multilingual","slug":"bridging-linguistic-typology-and-multilingual","title":"Bridging Linguistic Typology and Multilingual Machine Translation with Multi-View Language Representations","date":"2020-04-30","arxiv_id":"2004.14923","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/bridging-linguistic-typology-and-multilingual#ran","syntology_url":"https://syntology.ai/paper/2004.14923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14923"}},"official":{"repos":["aoncevay/multiview-langrep"],"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":["official"]}}},{"url":"/paper/language-model-prior-for-low-resource-neural","slug":"language-model-prior-for-low-resource-neural","title":"Language Model Prior for Low-Resource Neural Machine Translation","date":"2020-04-30","arxiv_id":"2004.14928","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-model-prior-for-low-resource-neural#ran","syntology_url":"https://syntology.ai/paper/2004.14928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14928"}},"official":{"repos":["cbaziotis/lm-prior-for-nmt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/imitation-attacks-and-defenses-for-black-box","slug":"imitation-attacks-and-defenses-for-black-box","title":"Imitation Attacks and Defenses for Black-box Machine Translation Systems","date":"2020-04-30","arxiv_id":"2004.15015","repositories_listed":1,"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/imitation-attacks-and-defenses-for-black-box#ran","syntology_url":"https://syntology.ai/paper/2004.15015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.15015"}},"official":{"repos":["Eric-Wallace/adversarial-mt"],"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/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lexically-constrained-neural-machine","slug":"lexically-constrained-neural-machine","title":"Lexically Constrained Neural Machine Translation with Levenshtein Transformer","date":"2020-04-27","arxiv_id":"2004.12681","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/lexically-constrained-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2004.12681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12681"}},"official":{"repos":["raymondhs/constrained-levt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/all-word-embeddings-from-one-embedding","slug":"all-word-embeddings-from-one-embedding","title":"All Word Embeddings from One Embedding","date":"2020-04-25","arxiv_id":"2004.12073","repositories_listed":1,"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/all-word-embeddings-from-one-embedding#ran","syntology_url":"https://syntology.ai/paper/2004.12073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12073"}},"official":{"repos":["takase/alone_seq2seq"],"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"]}}},{"url":"/paper/g-daug-generative-data-augmentation-for","slug":"g-daug-generative-data-augmentation-for","title":"Generative Data Augmentation for Commonsense Reasoning","date":"2020-04-24","arxiv_id":"2004.11546","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/g-daug-generative-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2004.11546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11546"}},"official":{"repos":["yangyiben/G-DAUG-c-Generative-Data-Augmentation-for-Commonsense-Reasoning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-massively-multilingual-neural","slug":"improving-massively-multilingual-neural","title":"Improving Massively Multilingual Neural Machine Translation and Zero-Shot Translation","date":"2020-04-24","arxiv_id":"2004.11867","repositories_listed":3,"syntology":{"n":13,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":11,"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) · 11 unverified","sample_list":"/paper/improving-massively-multilingual-neural#ran","syntology_url":"https://syntology.ai/paper/2004.11867","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11867"}},"official":{"repos":["EdinburghNLP/opus-100-corpus","bzhangGo/zero"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/practical-comparable-data-collection-for-low","slug":"practical-comparable-data-collection-for-low","title":"Practical Comparable Data Collection for Low-Resource Languages via Images","date":"2020-04-24","arxiv_id":"2004.11954","repositories_listed":1,"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/practical-comparable-data-collection-for-low#ran","syntology_url":"https://syntology.ai/paper/2004.11954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11954"}},"official":{"repos":["madaan/PML4DC-Comparable-Data-Collection"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-module-is-not-only-a-weight","slug":"attention-module-is-not-only-a-weight","title":"Attention is Not Only a Weight: Analyzing Transformers with Vector Norms","date":"2020-04-21","arxiv_id":"2004.10102","repositories_listed":1,"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":4,"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/attention-module-is-not-only-a-weight#ran","syntology_url":"https://syntology.ai/paper/2004.10102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10102"}},"official":{"repos":["gorokoba560/norm-analysis-of-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bringing-old-photos-back-to-life","slug":"bringing-old-photos-back-to-life","title":"Bringing Old Photos Back to Life","date":"2020-04-20","arxiv_id":"2004.09484","repositories_listed":7,"syntology":{"n":31,"n_ran":25,"n_constructed":0,"n_ran_checked":24,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":24,"n_pointer_only":21,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 24 with no instrument failure: 0 honoured, 0 violated, 24 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bringing-old-photos-back-to-life#ran","syntology_url":"https://syntology.ai/paper/2004.09484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09484"}},"official":{"repos":["microsoft/Bringing-Old-Photos-Back-to-Life"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/simalign-high-quality-word-alignments-without","slug":"simalign-high-quality-word-alignments-without","title":"SimAlign: High Quality Word Alignments without Parallel Training Data using Static and Contextualized Embeddings","date":"2020-04-18","arxiv_id":"2004.08728","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/simalign-high-quality-word-alignments-without#ran","syntology_url":"https://syntology.ai/paper/2004.08728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08728"}},"official":{"repos":["masoudjs/simalign"],"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/non-autoregressive-machine-translation-with-1","slug":"non-autoregressive-machine-translation-with-1","title":"Non-Autoregressive Machine Translation with Latent Alignments","date":"2020-04-16","arxiv_id":"2004.07437","repositories_listed":2,"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/non-autoregressive-machine-translation-with-1#ran","syntology_url":"https://syntology.ai/paper/2004.07437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07437"}},"official":null}},{"url":"/paper/balancing-training-for-multilingual-neural","slug":"balancing-training-for-multilingual-neural","title":"Balancing Training for Multilingual Neural Machine Translation","date":"2020-04-14","arxiv_id":"2004.06748","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/balancing-training-for-multilingual-neural#ran","syntology_url":"https://syntology.ai/paper/2004.06748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06748"}},"official":{"repos":["cindyxinyiwang/multiDDS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bleu-might-be-guilty-but-references-are-not","slug":"bleu-might-be-guilty-but-references-are-not","title":"BLEU might be Guilty but References are not Innocent","date":"2020-04-13","arxiv_id":"2004.06063","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bleu-might-be-guilty-but-references-are-not#ran","syntology_url":"https://syntology.ai/paper/2004.06063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06063"}},"official":{"repos":["google/wmt19-paraphrased-references"],"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-domain-correspondence-learning-for","slug":"cross-domain-correspondence-learning-for","title":"Cross-domain Correspondence Learning for Exemplar-based Image Translation","date":"2020-04-12","arxiv_id":"2004.05571","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-domain-correspondence-learning-for#ran","syntology_url":"https://syntology.ai/paper/2004.05571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05571"}},"official":null}},{"url":"/paper/graph-to-tree-neural-networks-for-learning","slug":"graph-to-tree-neural-networks-for-learning","title":"Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem","date":"2020-04-07","arxiv_id":"2004.13781","repositories_listed":1,"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-tree-neural-networks-for-learning#ran","syntology_url":"https://syntology.ai/paper/2004.13781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13781"}},"official":{"repos":["IBM/Graph2Tree"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-quantization-improves-gan-training","slug":"feature-quantization-improves-gan-training","title":"Feature Quantization Improves GAN Training","date":"2020-04-05","arxiv_id":"2004.02088","repositories_listed":2,"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":1,"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/feature-quantization-improves-gan-training#ran","syntology_url":"https://syntology.ai/paper/2004.02088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02088"}},"official":{"repos":["YangNaruto/FQ-GAN"],"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":["found_in_text","official"]}}},{"url":"/paper/aligned-cross-entropy-for-non-autoregressive","slug":"aligned-cross-entropy-for-non-autoregressive","title":"Aligned Cross Entropy for Non-Autoregressive Machine Translation","date":"2020-04-03","arxiv_id":"2004.01655","repositories_listed":1,"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":1,"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/aligned-cross-entropy-for-non-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2004.01655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01655"}},"official":null}},{"url":"/paper/a-set-of-recommendations-for-assessing-human","slug":"a-set-of-recommendations-for-assessing-human","title":"A Set of Recommendations for Assessing Human-Machine Parity in Language Translation","date":"2020-04-03","arxiv_id":"2004.01694","repositories_listed":1,"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":1,"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/a-set-of-recommendations-for-assessing-human#ran","syntology_url":"https://syntology.ai/paper/2004.01694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01694"}},"official":{"repos":["ZurichNLP/mt-parity-assessment-data"],"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/editable-neural-networks-1","slug":"editable-neural-networks-1","title":"Editable Neural Networks","date":"2020-04-01","arxiv_id":"2004.00345","repositories_listed":5,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/editable-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2004.00345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00345"}},"official":{"repos":["editable-ICLR2020/editable","xtinkt/editable"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sign-language-translation-with-transformers","slug":"sign-language-translation-with-transformers","title":"Better Sign Language Translation with STMC-Transformer","date":"2020-04-01","arxiv_id":"2004.00588","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sign-language-translation-with-transformers#ran","syntology_url":"https://syntology.ai/paper/2004.00588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00588"}},"official":{"repos":["kayoyin/transformer-slt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sign-language-transformers-joint-end-to-end","slug":"sign-language-transformers-joint-end-to-end","title":"Sign Language Transformers: Joint End-to-end Sign Language Recognition and Translation","date":"2020-03-30","arxiv_id":"2003.13830","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sign-language-transformers-joint-end-to-end#ran","syntology_url":"https://syntology.ai/paper/2003.13830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13830"}},"official":{"repos":["neccam/slt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/variational-transformers-for-diverse-response","slug":"variational-transformers-for-diverse-response","title":"Variational Transformers for Diverse Response Generation","date":"2020-03-28","arxiv_id":"2003.12738","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/variational-transformers-for-diverse-response#ran","syntology_url":"https://syntology.ai/paper/2003.12738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12738"}},"official":{"repos":["zlinao/Variational-Transformer"],"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":["official"]}}},{"url":"/paper/ffr-v1-0-fon-french-neural-machine","slug":"ffr-v1-0-fon-french-neural-machine","title":"FFR V1.0: Fon-French Neural Machine Translation","date":"2020-03-26","arxiv_id":"2003.12111","repositories_listed":1,"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/ffr-v1-0-fon-french-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2003.12111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12111"}},"official":{"repos":["bonaventuredossou/ffr-v1"],"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/felix-flexible-text-editing-through-tagging","slug":"felix-flexible-text-editing-through-tagging","title":"Felix: Flexible Text Editing Through Tagging and Insertion","date":"2020-03-24","arxiv_id":"2003.10687","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 3 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) · 2 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/felix-flexible-text-editing-through-tagging#ran","syntology_url":"https://syntology.ai/paper/2003.10687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10687"}},"official":{"repos":["google-research/google-research"],"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/synthesizing-human-like-sketches-from-natural","slug":"synthesizing-human-like-sketches-from-natural","title":"Synthesizing human-like sketches from natural images using a conditional convolutional decoder","date":"2020-03-16","arxiv_id":"2003.07101","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/synthesizing-human-like-sketches-from-natural#ran","syntology_url":"https://syntology.ai/paper/2003.07101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07101"}},"official":{"repos":["kampelmuehler/synthesizing_human_like_sketches"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tydi-qa-a-benchmark-for-information-seeking","slug":"tydi-qa-a-benchmark-for-information-seeking","title":"TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languages","date":"2020-03-10","arxiv_id":"2003.05002","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":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/tydi-qa-a-benchmark-for-information-seeking#ran","syntology_url":"https://syntology.ai/paper/2003.05002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05002"}},"official":{"repos":["google-research-datasets/tydiqa"],"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/towards-automatic-face-to-face-translation-1","slug":"towards-automatic-face-to-face-translation-1","title":"Towards Automatic Face-to-Face Translation","date":"2020-03-01","arxiv_id":"2003.00418","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-automatic-face-to-face-translation-1#ran","syntology_url":"https://syntology.ai/paper/2003.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00418"}},"official":{"repos":["Rudrabha/LipGAN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smoke-single-stage-monocular-3d-object","slug":"smoke-single-stage-monocular-3d-object","title":"SMOKE: Single-Stage Monocular 3D Object Detection via Keypoint Estimation","date":"2020-02-24","arxiv_id":"2002.10111","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/smoke-single-stage-monocular-3d-object#ran","syntology_url":"https://syntology.ai/paper/2002.10111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10111"}},"official":{"repos":["lzccccc/SMOKE"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accessing-higher-level-representations-in","slug":"accessing-higher-level-representations-in","title":"Addressing Some Limitations of Transformers with Feedback Memory","date":"2020-02-21","arxiv_id":"2002.09402","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"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: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accessing-higher-level-representations-in#ran","syntology_url":"https://syntology.ai/paper/2002.09402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09402"}},"official":{"repos":["facebookresearch/transformer-sequential"],"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/roto-translation-equivariant-convolutional","slug":"roto-translation-equivariant-convolutional","title":"Roto-Translation Equivariant Convolutional Networks: Application to Histopathology Image Analysis","date":"2020-02-20","arxiv_id":"2002.08725","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/roto-translation-equivariant-convolutional#ran","syntology_url":"https://syntology.ai/paper/2002.08725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08725"}},"official":{"repos":["tueimage/se2cnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-layer-representation-fusion-for-neural-2","slug":"multi-layer-representation-fusion-for-neural-2","title":"Multi-layer Representation Fusion for Neural Machine Translation","date":"2020-02-16","arxiv_id":"2002.06714","repositories_listed":1,"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":1,"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/multi-layer-representation-fusion-for-neural-2#ran","syntology_url":"https://syntology.ai/paper/2002.06714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06714"}},"official":null}},{"url":"/paper/a-probabilistic-formulation-of-unsupervised-1","slug":"a-probabilistic-formulation-of-unsupervised-1","title":"A Probabilistic Formulation of Unsupervised Text Style Transfer","date":"2020-02-10","arxiv_id":"2002.03912","repositories_listed":5,"syntology":{"n":25,"n_ran":18,"n_constructed":13,"n_ran_checked":11,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"phrase":"18 ran (of which 13 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-probabilistic-formulation-of-unsupervised-1#ran","syntology_url":"https://syntology.ai/paper/2002.03912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03912"}},"official":{"repos":["cindyxinyiwang/deep-latent-sequence-model"],"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/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","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/covost-a-diverse-multilingual-speech-to-text","slug":"covost-a-diverse-multilingual-speech-to-text","title":"CoVoST: A Diverse Multilingual Speech-To-Text Translation Corpus","date":"2020-02-04","arxiv_id":"2002.01320","repositories_listed":1,"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/covost-a-diverse-multilingual-speech-to-text#ran","syntology_url":"https://syntology.ai/paper/2002.01320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01320"}},"official":{"repos":["facebookresearch/covost"],"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/controlling-generative-models-with-continuous-1","slug":"controlling-generative-models-with-continuous-1","title":"Controlling generative models with continuous factors of variations","date":"2020-01-28","arxiv_id":"2001.10238","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":4,"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/controlling-generative-models-with-continuous-1#ran","syntology_url":"https://syntology.ai/paper/2001.10238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.10238"}},"official":{"repos":["AntoinePlumerault/Controlling-generative-models-with-continuous-factors-of-variations"],"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/teaser-fast-and-certifiable-point-cloud","slug":"teaser-fast-and-certifiable-point-cloud","title":"TEASER: Fast and Certifiable Point Cloud Registration","date":"2020-01-21","arxiv_id":"2001.07715","repositories_listed":7,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/teaser-fast-and-certifiable-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2001.07715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.07715"}},"official":{"repos":["MIT-SPARK/TEASER-plusplus"],"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":["listed","official"]}}},{"url":"/paper/explicit-sparse-transformer-concentrated","slug":"explicit-sparse-transformer-concentrated","title":"Explicit Sparse Transformer: Concentrated Attention Through Explicit Selection","date":"2019-12-25","arxiv_id":"1912.11637","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"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 1 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/explicit-sparse-transformer-concentrated#ran","syntology_url":"https://syntology.ai/paper/1912.11637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11637"}},"official":{"repos":["lancopku/Explicit-Sparse-Transformer"],"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":["unlocated"]}}},{"url":"/paper/m2-meshed-memory-transformer-for-image","slug":"m2-meshed-memory-transformer-for-image","title":"Meshed-Memory Transformer for Image Captioning","date":"2019-12-17","arxiv_id":"1912.08226","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/m2-meshed-memory-transformer-for-image#ran","syntology_url":"https://syntology.ai/paper/1912.08226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08226"}},"official":{"repos":["aimagelab/meshed-memory-transformer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-spanish-translation-of-the-squad","slug":"automatic-spanish-translation-of-the-squad","title":"Automatic Spanish Translation of the SQuAD Dataset for Multilingual Question Answering","date":"2019-12-11","arxiv_id":"1912.05200","repositories_listed":3,"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/automatic-spanish-translation-of-the-squad#ran","syntology_url":"https://syntology.ai/paper/1912.05200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05200"}},"official":{"repos":["ccasimiro88/TranslateAlignRetrieve"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/stargan-v2-diverse-image-synthesis-for","slug":"stargan-v2-diverse-image-synthesis-for","title":"StarGAN v2: Diverse Image Synthesis for Multiple Domains","date":"2019-12-04","arxiv_id":"1912.01865","repositories_listed":14,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/stargan-v2-diverse-image-synthesis-for#ran","syntology_url":"https://syntology.ai/paper/1912.01865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.01865"}},"official":{"repos":["clovaai/stargan-v2"],"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-a-review","slug":"neural-machine-translation-a-review","title":"Neural Machine Translation: A Review and Survey","date":"2019-12-04","arxiv_id":"1912.02047","repositories_listed":2,"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/neural-machine-translation-a-review#ran","syntology_url":"https://syntology.ai/paper/1912.02047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02047"}},"official":null}},{"url":"/paper/word2word-a-collection-of-bilingual-lexicons","slug":"word2word-a-collection-of-bilingual-lexicons","title":"word2word: A Collection of Bilingual Lexicons for 3,564 Language Pairs","date":"2019-11-27","arxiv_id":"1911.12019","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/word2word-a-collection-of-bilingual-lexicons#ran","syntology_url":"https://syntology.ai/paper/1911.12019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12019"}},"official":null}},{"url":"/paper/fine-tuning-by-curriculum-learning-for-non","slug":"fine-tuning-by-curriculum-learning-for-non","title":"Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation","date":"2019-11-20","arxiv_id":"1911.08717","repositories_listed":2,"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/fine-tuning-by-curriculum-learning-for-non#ran","syntology_url":"https://syntology.ai/paper/1911.08717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08717"}},"official":{"repos":["lemmonation/fcl-nat"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-transformer-for-graph-to-sequence","slug":"graph-transformer-for-graph-to-sequence","title":"Graph Transformer for Graph-to-Sequence Learning","date":"2019-11-18","arxiv_id":"1911.07470","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/graph-transformer-for-graph-to-sequence#ran","syntology_url":"https://syntology.ai/paper/1911.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07470"}},"official":{"repos":["jcyk/gtos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bp-transformer-modelling-long-range-context","slug":"bp-transformer-modelling-long-range-context","title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","date":"2019-11-11","arxiv_id":"1911.04070","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/bp-transformer-modelling-long-range-context#ran","syntology_url":"https://syntology.ai/paper/1911.04070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04070"}},"official":{"repos":["yzh119/BPT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/distilling-the-knowledge-of-bert-for-text-1","slug":"distilling-the-knowledge-of-bert-for-text-1","title":"Distilling Knowledge Learned in BERT for Text Generation","date":"2019-11-10","arxiv_id":"1911.03829","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distilling-the-knowledge-of-bert-for-text-1#ran","syntology_url":"https://syntology.ai/paper/1911.03829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03829"}},"official":{"repos":["ChenRocks/Distill-BERT-Textgen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-robustness-in-neural-machine","slug":"domain-robustness-in-neural-machine","title":"Domain Robustness in Neural Machine Translation","date":"2019-11-08","arxiv_id":"1911.03109","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/domain-robustness-in-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1911.03109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03109"}},"official":{"repos":["ZurichNLP/domain-robustness","ZurichNLP/sockeye"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","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"}},"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"]}}},{"url":"/paper/multi-marginal-wasserstein-gan","slug":"multi-marginal-wasserstein-gan","title":"Multi-marginal Wasserstein GAN","date":"2019-11-03","arxiv_id":"1911.00888","repositories_listed":3,"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/multi-marginal-wasserstein-gan#ran","syntology_url":"https://syntology.ai/paper/1911.00888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00888"}},"official":{"repos":["caojiezhang/MWGAN"],"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-modeling-with-unconstrained","slug":"sequence-modeling-with-unconstrained","title":"Sequence Modeling with Unconstrained Generation Order","date":"2019-11-01","arxiv_id":"1911.00176","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sequence-modeling-with-unconstrained#ran","syntology_url":"https://syntology.ai/paper/1911.00176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00176"}},"official":{"repos":["TIXFeniks/neurips2019_intrus"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pseudolikelihood-reranking-with-masked","slug":"pseudolikelihood-reranking-with-masked","title":"Masked Language Model Scoring","date":"2019-10-31","arxiv_id":"1910.14659","repositories_listed":6,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pseudolikelihood-reranking-with-masked#ran","syntology_url":"https://syntology.ai/paper/1910.14659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.14659"}},"official":{"repos":["awslabs/mlm-scoring"],"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"]}}}],"record_sha256":"e8e9422f58047f999b559f50409b345c6a4917594fd115cc9a7f66b3427c2151","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}