{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/machine-translation/papers/ran/4","list_of":"/task/machine-translation","task":"Machine Translation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":477,"counts":{"archive_papers_tagged":10752,"with_a_code_link":2444,"where_syntology_ran_a_sample":477,"not_listed_spam_title":0,"listed":10752,"listed_where_code_ran":477,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":381,"every_run_a_failure_of_syntologys_instrument":96,"listed_with_a_run_with_no_instrument_failure":381,"listed_every_run_a_failure_of_syntologys_instrument":96,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/machine-translation/papers/ran/1","prev":"/task/machine-translation/papers/ran/3","next":"/task/machine-translation/papers/ran/5","papers":[{"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/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/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/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/self-knowledge-distillation-a-simple-way-for","slug":"self-knowledge-distillation-a-simple-way-for","title":"Self-Knowledge Distillation with Progressive Refinement of Targets","date":"2020-06-22","arxiv_id":"2006.12000","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-knowledge-distillation-a-simple-way-for#ran","syntology_url":"https://syntology.ai/paper/2006.12000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12000"}},"official":{"repos":["lgcnsai/ps-kd-pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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/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/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/understanding-the-difficulty-of-training","slug":"understanding-the-difficulty-of-training","title":"Understanding the Difficulty of Training Transformers","date":"2020-04-17","arxiv_id":"2004.08249","repositories_listed":2,"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/understanding-the-difficulty-of-training#ran","syntology_url":"https://syntology.ai/paper/2004.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08249"}},"official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"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/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/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/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/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}},"official":null}},{"url":"/paper/investigating-entity-knowledge-in-bert-with-1","slug":"investigating-entity-knowledge-in-bert-with-1","title":"Investigating Entity Knowledge in BERT with Simple Neural End-To-End Entity Linking","date":"2020-03-11","arxiv_id":"2003.05473","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/investigating-entity-knowledge-in-bert-with-1#ran","syntology_url":"https://syntology.ai/paper/2003.05473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05473"}},"official":{"repos":["samuelbroscheit/entity_knowledge_in_bert"],"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/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/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/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/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/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/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/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/191013267","slug":"191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","arxiv_id":"1910.13267","repositories_listed":7,"syntology":{"n":24,"n_ran":24,"n_constructed":0,"n_ran_checked":15,"n_instrument":9,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":14,"n_pointer_only":1,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 1 violated, 14 with no contract checked; 9 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/191013267#ran","syntology_url":"https://syntology.ai/paper/1910.13267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13267"}},"official":{"repos":["VProv/BPE-Dropout"],"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":["listed","official"]}}},{"url":"/paper/bart-denoising-sequence-to-sequence-pre","slug":"bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","arxiv_id":"1910.13461","repositories_listed":47,"syntology":{"n":53,"n_ran":40,"n_constructed":7,"n_ran_checked":31,"n_instrument":9,"n_unverified":13,"n_honours":1,"n_violates":1,"n_no_contract":29,"n_pointer_only":13,"phrase":"40 ran (of which 7 constructed an object rather than computing a result; 31 with no instrument failure: 1 honoured, 1 violated, 29 with no contract checked; 9 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/bart-denoising-sequence-to-sequence-pre#ran","syntology_url":"https://syntology.ai/paper/1910.13461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13461"}},"official":null}},{"url":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","repositories_listed":57,"syntology":{"n":31,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}},"official":null}},{"url":"/paper/mlqa-evaluating-cross-lingual-extractive","slug":"mlqa-evaluating-cross-lingual-extractive","title":"MLQA: Evaluating Cross-lingual Extractive Question Answering","date":"2019-10-16","arxiv_id":"1910.07475","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/mlqa-evaluating-cross-lingual-extractive#ran","syntology_url":"https://syntology.ai/paper/1910.07475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.07475"}},"official":{"repos":["facebookresearch/MLQA"],"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/transformers-without-tears-improving-the","slug":"transformers-without-tears-improving-the","title":"Transformers without Tears: Improving the Normalization of Self-Attention","date":"2019-10-14","arxiv_id":"1910.05895","repositories_listed":5,"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/transformers-without-tears-improving-the#ran","syntology_url":"https://syntology.ai/paper/1910.05895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05895"}},"official":{"repos":["tnq177/transformers_without_tears"],"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/stabilizing-transformers-for-reinforcement-1","slug":"stabilizing-transformers-for-reinforcement-1","title":"Stabilizing Transformers for Reinforcement Learning","date":"2019-10-13","arxiv_id":"1910.06764","repositories_listed":5,"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":3,"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/stabilizing-transformers-for-reinforcement-1#ran","syntology_url":"https://syntology.ai/paper/1910.06764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06764"}},"official":null}},{"url":"/paper/on-the-adequacy-of-untuned-warmup-for","slug":"on-the-adequacy-of-untuned-warmup-for","title":"On the adequacy of untuned warmup for adaptive optimization","date":"2019-10-09","arxiv_id":"1910.04209","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/on-the-adequacy-of-untuned-warmup-for#ran","syntology_url":"https://syntology.ai/paper/1910.04209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04209"}},"official":null}},{"url":"/paper/domain-differential-adaptation-for-neural","slug":"domain-differential-adaptation-for-neural","title":"Domain Differential Adaptation for Neural Machine Translation","date":"2019-10-07","arxiv_id":"1910.02555","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/domain-differential-adaptation-for-neural#ran","syntology_url":"https://syntology.ai/paper/1910.02555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02555"}},"official":{"repos":["zdou0830/DDA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multilingual-end-to-end-speech-translation","slug":"multilingual-end-to-end-speech-translation","title":"Multilingual End-to-End Speech Translation","date":"2019-10-01","arxiv_id":"1910.00254","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/multilingual-end-to-end-speech-translation#ran","syntology_url":"https://syntology.ai/paper/1910.00254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00254"}},"official":{"repos":["espnet/espnet"],"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/when-and-why-is-document-level-context-useful","slug":"when-and-why-is-document-level-context-useful","title":"When and Why is Document-level Context Useful in Neural Machine Translation?","date":"2019-10-01","arxiv_id":"1910.00294","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/when-and-why-is-document-level-context-useful#ran","syntology_url":"https://syntology.ai/paper/1910.00294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00294"}},"official":{"repos":["ducthanhtran/sockeye_document_context"],"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/espresso-a-fast-end-to-end-neural-speech","slug":"espresso-a-fast-end-to-end-neural-speech","title":"Espresso: A Fast End-to-end Neural Speech Recognition Toolkit","date":"2019-09-18","arxiv_id":"1909.08723","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/espresso-a-fast-end-to-end-neural-speech#ran","syntology_url":"https://syntology.ai/paper/1909.08723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08723"}},"official":{"repos":["freewym/espresso"],"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/beyond-bleu-training-neural-machine","slug":"beyond-bleu-training-neural-machine","title":"Beyond BLEU: Training Neural Machine Translation with Semantic Similarity","date":"2019-09-14","arxiv_id":"1909.06694","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/beyond-bleu-training-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1909.06694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06694"}},"official":null}},{"url":"/paper/flowseq-non-autoregressive-conditional","slug":"flowseq-non-autoregressive-conditional","title":"FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow","date":"2019-09-05","arxiv_id":"1909.02480","repositories_listed":2,"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":0,"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/flowseq-non-autoregressive-conditional#ran","syntology_url":"https://syntology.ai/paper/1909.02480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02480"}},"official":{"repos":["XuezheMax/flowseq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/moverscore-text-generation-evaluating-with","slug":"moverscore-text-generation-evaluating-with","title":"MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distance","date":"2019-09-05","arxiv_id":"1909.02622","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/moverscore-text-generation-evaluating-with#ran","syntology_url":"https://syntology.ai/paper/1909.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02622"}},"official":null}},{"url":"/paper/adaptively-sparse-transformers","slug":"adaptively-sparse-transformers","title":"Adaptively Sparse Transformers","date":"2019-08-30","arxiv_id":"1909.00015","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptively-sparse-transformers#ran","syntology_url":"https://syntology.ai/paper/1909.00015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00015"}},"official":{"repos":["deep-spin/entmax"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unsupervised-domain-adaptation-for-neural","slug":"unsupervised-domain-adaptation-for-neural","title":"Unsupervised Domain Adaptation for Neural Machine Translation with Domain-Aware Feature Embeddings","date":"2019-08-27","arxiv_id":"1908.10430","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-domain-adaptation-for-neural#ran","syntology_url":"https://syntology.ai/paper/1908.10430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10430"}},"official":{"repos":["zdou0830/DAFE"],"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/uniblock-scoring-and-filtering-corpus-with","slug":"uniblock-scoring-and-filtering-corpus-with","title":"uniblock: Scoring and Filtering Corpus with Unicode Block Information","date":"2019-08-26","arxiv_id":"1908.09716","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":0,"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/uniblock-scoring-and-filtering-corpus-with#ran","syntology_url":"https://syntology.ai/paper/1908.09716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09716"}},"official":{"repos":["ringoreality/uniblock"],"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/latent-variable-non-autoregressive-neural","slug":"latent-variable-non-autoregressive-neural","title":"Latent-Variable Non-Autoregressive Neural Machine Translation with Deterministic Inference Using a Delta Posterior","date":"2019-08-20","arxiv_id":"1908.07181","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/latent-variable-non-autoregressive-neural#ran","syntology_url":"https://syntology.ai/paper/1908.07181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07181"}},"official":{"repos":["zomux/lanmt"],"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/on-the-variance-of-the-adaptive-learning-rate","slug":"on-the-variance-of-the-adaptive-learning-rate","title":"On the Variance of the Adaptive Learning Rate and Beyond","date":"2019-08-08","arxiv_id":"1908.03265","repositories_listed":21,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-variance-of-the-adaptive-learning-rate#ran","syntology_url":"https://syntology.ai/paper/1908.03265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03265"}},"official":{"repos":["LiyuanLucasLiu/RAdam"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/leveraging-pre-trained-checkpoints-for","slug":"leveraging-pre-trained-checkpoints-for","title":"Leveraging Pre-trained Checkpoints for Sequence Generation Tasks","date":"2019-07-29","arxiv_id":"1907.12461","repositories_listed":7,"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/leveraging-pre-trained-checkpoints-for#ran","syntology_url":"https://syntology.ai/paper/1907.12461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12461"}},"official":null}},{"url":"/paper/joey-nmt-a-minimalist-nmt-toolkit-for-novices","slug":"joey-nmt-a-minimalist-nmt-toolkit-for-novices","title":"Joey NMT: A Minimalist NMT Toolkit for Novices","date":"2019-07-29","arxiv_id":"1907.12484","repositories_listed":8,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/joey-nmt-a-minimalist-nmt-toolkit-for-novices#ran","syntology_url":"https://syntology.ai/paper/1907.12484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12484"}},"official":{"repos":["joeynmt/joeynmt"],"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/facebook-fairs-wmt19-news-translation-task","slug":"facebook-fairs-wmt19-news-translation-task","title":"Facebook FAIR's WMT19 News Translation Task Submission","date":"2019-07-15","arxiv_id":"1907.06616","repositories_listed":5,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/facebook-fairs-wmt19-news-translation-task#ran","syntology_url":"https://syntology.ai/paper/1907.06616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06616"}},"official":null}},{"url":"/paper/retrieving-sequential-information-for-non","slug":"retrieving-sequential-information-for-non","title":"Retrieving Sequential Information for Non-Autoregressive Neural Machine Translation","date":"2019-06-22","arxiv_id":"1906.09444","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/retrieving-sequential-information-for-non#ran","syntology_url":"https://syntology.ai/paper/1906.09444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09444"}},"official":{"repos":["ictnlp/RSI-NAT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-simple-and-effective-approach-to-automatic","slug":"a-simple-and-effective-approach-to-automatic","title":"A Simple and Effective Approach to Automatic Post-Editing with Transfer Learning","date":"2019-06-14","arxiv_id":"1906.06253","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-simple-and-effective-approach-to-automatic#ran","syntology_url":"https://syntology.ai/paper/1906.06253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06253"}},"official":{"repos":["deep-spin/OpenNMT-APE"],"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/neural-arabic-question-answering","slug":"neural-arabic-question-answering","title":"Neural Arabic Question Answering","date":"2019-06-12","arxiv_id":"1906.05394","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-arabic-question-answering#ran","syntology_url":"https://syntology.ai/paper/1906.05394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05394"}},"official":{"repos":["husseinmozannar/SOQAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/syntactically-supervised-transformers-for","slug":"syntactically-supervised-transformers-for","title":"Syntactically Supervised Transformers for Faster Neural Machine Translation","date":"2019-06-06","arxiv_id":"1906.02780","repositories_listed":1,"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/syntactically-supervised-transformers-for#ran","syntology_url":"https://syntology.ai/paper/1906.02780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02780"}},"official":{"repos":["dojoteef/synst"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-deep-transformer-models-for-machine","slug":"learning-deep-transformer-models-for-machine","title":"Learning Deep Transformer Models for Machine Translation","date":"2019-06-05","arxiv_id":"1906.01787","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"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 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-deep-transformer-models-for-machine#ran","syntology_url":"https://syntology.ai/paper/1906.01787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01787"}},"official":{"repos":["wangqiangneu/dlcl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600591","slug":"190600591","title":"Evaluating Gender Bias in Machine Translation","date":"2019-06-03","arxiv_id":"1906.00591","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190600591#ran","syntology_url":"https://syntology.ai/paper/1906.00591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00591"}},"official":null}},{"url":"/paper/190600376","slug":"190600376","title":"Domain Adaptation of Neural Machine Translation by Lexicon Induction","date":"2019-06-02","arxiv_id":"1906.00376","repositories_listed":2,"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/190600376#ran","syntology_url":"https://syntology.ai/paper/1906.00376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00376"}},"official":null}},{"url":"/paper/a-generalized-framework-of-sequence","slug":"a-generalized-framework-of-sequence","title":"A Generalized Framework of Sequence Generation with Application to Undirected Sequence Models","date":"2019-05-29","arxiv_id":"1905.12790","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 2 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/a-generalized-framework-of-sequence#ran","syntology_url":"https://syntology.ai/paper/1905.12790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12790"}},"official":{"repos":["nyu-dl/dl4mt-seqgen"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/revisiting-low-resource-neural-machine","slug":"revisiting-low-resource-neural-machine","title":"Revisiting Low-Resource Neural Machine Translation: A Case Study","date":"2019-05-28","arxiv_id":"1905.11901","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/revisiting-low-resource-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1905.11901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11901"}},"official":null}},{"url":"/paper/cdsa-cross-dimensional-self-attention-for","slug":"cdsa-cross-dimensional-self-attention-for","title":"CDSA: Cross-Dimensional Self-Attention for Multivariate, Geo-tagged Time Series Imputation","date":"2019-05-23","arxiv_id":"1905.09904","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/cdsa-cross-dimensional-self-attention-for#ran","syntology_url":"https://syntology.ai/paper/1905.09904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09904"}},"official":null}},{"url":"/paper/transformers-with-convolutional-context-for","slug":"transformers-with-convolutional-context-for","title":"Transformers with convolutional context for ASR","date":"2019-04-26","arxiv_id":"1904.11660","repositories_listed":4,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transformers-with-convolutional-context-for#ran","syntology_url":"https://syntology.ai/paper/1904.11660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11660"}},"official":null}},{"url":"/paper/compositional-generalization-in-a-deep","slug":"compositional-generalization-in-a-deep","title":"Compositional generalization in a deep seq2seq model by separating syntax and semantics","date":"2019-04-22","arxiv_id":"1904.09708","repositories_listed":1,"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/compositional-generalization-in-a-deep#ran","syntology_url":"https://syntology.ai/paper/1904.09708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09708"}},"official":null}},{"url":"/paper/bertscore-evaluating-text-generation-with","slug":"bertscore-evaluating-text-generation-with","title":"BERTScore: Evaluating Text Generation with BERT","date":"2019-04-21","arxiv_id":"1904.09675","repositories_listed":20,"syntology":{"n":76,"n_ran":44,"n_constructed":4,"n_ran_checked":10,"n_instrument":34,"n_unverified":32,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":33,"phrase":"44 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 34 where Syntology's instrument failed) · 32 unverified","sample_list":"/paper/bertscore-evaluating-text-generation-with#ran","syntology_url":"https://syntology.ai/paper/1904.09675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09675"}},"official":{"repos":["Tiiiger/bert_score"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/190409324","slug":"190409324","title":"Mask-Predict: Parallel Decoding of Conditional Masked Language Models","date":"2019-04-19","arxiv_id":"1904.09324","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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190409324#ran","syntology_url":"https://syntology.ai/paper/1904.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09324"}},"official":{"repos":["facebookresearch/Mask-Predict"],"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-evaluation-of-adversarial-perturbations","slug":"on-evaluation-of-adversarial-perturbations","title":"On Evaluation of Adversarial Perturbations for Sequence-to-Sequence Models","date":"2019-03-15","arxiv_id":"1903.06620","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":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/on-evaluation-of-adversarial-perturbations#ran","syntology_url":"https://syntology.ai/paper/1903.06620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.06620"}},"official":{"repos":["pmichel31415/teapot-nlp"],"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/two-new-evaluation-datasets-for-low-resource","slug":"two-new-evaluation-datasets-for-low-resource","title":"The FLoRes Evaluation Datasets for Low-Resource Machine Translation: Nepali-English and Sinhala-English","date":"2019-02-04","arxiv_id":"1902.01382","repositories_listed":2,"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/two-new-evaluation-datasets-for-low-resource#ran","syntology_url":"https://syntology.ai/paper/1902.01382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01382"}},"official":{"repos":["facebookresearch/flores"],"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/glyce-glyph-vectors-for-chinese-character","slug":"glyce-glyph-vectors-for-chinese-character","title":"Glyce: Glyph-vectors for Chinese Character Representations","date":"2019-01-29","arxiv_id":"1901.10125","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glyce-glyph-vectors-for-chinese-character#ran","syntology_url":"https://syntology.ai/paper/1901.10125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10125"}},"official":{"repos":["ShannonAI/glyce"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"3ca63f163fac0d428ed66bc28ff60e4f4f5cb0f0ab23541af9d1c1cffedfca70","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}