{"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/language-modeling/papers/ran/18","list_of":"/task/language-modeling","task":"Language Modeling","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":18,"pages_in_order":19,"rows_per_page":100,"rows":[1701,1800],"of":1894,"counts":{"archive_papers_tagged":14182,"with_a_code_link":5620,"where_syntology_ran_a_sample":1894,"not_listed_spam_title":0,"listed":14182,"listed_where_code_ran":1894,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1580,"every_run_a_failure_of_syntologys_instrument":314,"listed_with_a_run_with_no_instrument_failure":1580,"listed_every_run_a_failure_of_syntologys_instrument":314,"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/language-modeling/papers/ran/1","prev":"/task/language-modeling/papers/ran/17","next":"/task/language-modeling/papers/ran/19","papers":[{"url":"/paper/conformer-convolution-augmented-transformer","slug":"conformer-convolution-augmented-transformer","title":"Conformer: Convolution-augmented Transformer for Speech Recognition","date":"2020-05-16","arxiv_id":"2005.08100","repositories_listed":25,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":2,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 3 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conformer-convolution-augmented-transformer#ran","syntology_url":"https://syntology.ai/paper/2005.08100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08100"}},"official":null}},{"url":"/paper/spelling-error-correction-with-soft-masked","slug":"spelling-error-correction-with-soft-masked","title":"Spelling Error Correction with Soft-Masked BERT","date":"2020-05-15","arxiv_id":"2005.07421","repositories_listed":5,"syntology":{"n":17,"n_ran":14,"n_constructed":2,"n_ran_checked":13,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":3,"phrase":"14 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spelling-error-correction-with-soft-masked#ran","syntology_url":"https://syntology.ai/paper/2005.07421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07421"}},"official":null}},{"url":"/paper/exploiting-syntactic-structure-for-better","slug":"exploiting-syntactic-structure-for-better","title":"Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach","date":"2020-05-12","arxiv_id":"2005.05864","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/exploiting-syntactic-structure-for-better#ran","syntology_url":"https://syntology.ai/paper/2005.05864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05864"}},"official":{"repos":["wenyudu/SDLM"],"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/soloist-few-shot-task-oriented-dialog-with-a","slug":"soloist-few-shot-task-oriented-dialog-with-a","title":"SOLOIST: Building Task Bots at Scale with Transfer Learning and Machine Teaching","date":"2020-05-11","arxiv_id":"2005.05298","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/soloist-few-shot-task-oriented-dialog-with-a#ran","syntology_url":"https://syntology.ai/paper/2005.05298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05298"}},"official":null}},{"url":"/paper/enabling-language-models-to-fill-in-the","slug":"enabling-language-models-to-fill-in-the","title":"Enabling Language Models to Fill in the Blanks","date":"2020-05-11","arxiv_id":"2005.05339","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/enabling-language-models-to-fill-in-the#ran","syntology_url":"https://syntology.ai/paper/2005.05339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05339"}},"official":{"repos":["chrisdonahue/ilm","worksheets.codalab.org/worksheets/0x9987b5d9cce74cf4b2a5f84b54ee447b"],"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/finding-universal-grammatical-relations-in","slug":"finding-universal-grammatical-relations-in","title":"Finding Universal Grammatical Relations in Multilingual BERT","date":"2020-05-09","arxiv_id":"2005.04511","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/finding-universal-grammatical-relations-in#ran","syntology_url":"https://syntology.ai/paper/2005.04511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04511"}},"official":{"repos":["ethanachi/multilingual-probing-visualization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/discrete-optimization-for-unsupervised","slug":"discrete-optimization-for-unsupervised","title":"Discrete Optimization for Unsupervised Sentence Summarization with Word-Level Extraction","date":"2020-05-04","arxiv_id":"2005.01791","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discrete-optimization-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2005.01791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01791"}},"official":{"repos":["raphael-sch/HC_Sentence_Summarization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transformer-based-end-to-end-question","slug":"transformer-based-end-to-end-question","title":"Simplifying Paragraph-level Question Generation via Transformer Language Models","date":"2020-05-03","arxiv_id":"2005.01107","repositories_listed":4,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/transformer-based-end-to-end-question#ran","syntology_url":"https://syntology.ai/paper/2005.01107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01107"}},"official":null}},{"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/on-faithfulness-and-factuality-in-abstractive","slug":"on-faithfulness-and-factuality-in-abstractive","title":"On Faithfulness and Factuality in Abstractive Summarization","date":"2020-05-02","arxiv_id":"2005.00661","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-faithfulness-and-factuality-in-abstractive#ran","syntology_url":"https://syntology.ai/paper/2005.00661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00661"}},"official":{"repos":["google-research-datasets/xsum_hallucination_annotations"],"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/connecting-the-dots-a-knowledgeable-path","slug":"connecting-the-dots-a-knowledgeable-path","title":"Connecting the Dots: A Knowledgeable Path Generator for Commonsense Question Answering","date":"2020-05-02","arxiv_id":"2005.00691","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/connecting-the-dots-a-knowledgeable-path#ran","syntology_url":"https://syntology.ai/paper/2005.00691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00691"}},"official":{"repos":["wangpf3/Commonsense-Path-Generator"],"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/unifiedqa-crossing-format-boundaries-with-a","slug":"unifiedqa-crossing-format-boundaries-with-a","title":"UnifiedQA: Crossing Format Boundaries With a Single QA System","date":"2020-05-02","arxiv_id":"2005.00700","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unifiedqa-crossing-format-boundaries-with-a#ran","syntology_url":"https://syntology.ai/paper/2005.00700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00700"}},"official":{"repos":["allenai/unifiedqa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/exploring-and-predicting-transferability","slug":"exploring-and-predicting-transferability","title":"Exploring and Predicting Transferability across NLP Tasks","date":"2020-05-02","arxiv_id":"2005.00770","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-and-predicting-transferability#ran","syntology_url":"https://syntology.ai/paper/2005.00770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00770"}},"official":{"repos":["tuvuumass/task-transferability"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-language-model-for-task-oriented","slug":"a-simple-language-model-for-task-oriented","title":"A Simple Language Model for Task-Oriented Dialogue","date":"2020-05-02","arxiv_id":"2005.00796","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-simple-language-model-for-task-oriented#ran","syntology_url":"https://syntology.ai/paper/2005.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00796"}},"official":{"repos":["salesforce/simpletod"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hero-hierarchical-encoder-for-video-language","slug":"hero-hierarchical-encoder-for-video-language","title":"HERO: Hierarchical Encoder for Video+Language Omni-representation Pre-training","date":"2020-05-01","arxiv_id":"2005.00200","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hero-hierarchical-encoder-for-video-language#ran","syntology_url":"https://syntology.ai/paper/2005.00200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00200"}},"official":{"repos":["linjieli222/HERO"],"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":["listed","official"]}}},{"url":"/paper/perturbed-masking-parameter-free-probing-for","slug":"perturbed-masking-parameter-free-probing-for","title":"Perturbed Masking: Parameter-free Probing for Analyzing and Interpreting BERT","date":"2020-04-30","arxiv_id":"2004.14786","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/perturbed-masking-parameter-free-probing-for#ran","syntology_url":"https://syntology.ai/paper/2004.14786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14786"}},"official":{"repos":["LividWo/Perturbed-Masking"],"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/modelling-suspense-in-short-stories-as","slug":"modelling-suspense-in-short-stories-as","title":"Modelling Suspense in Short Stories as Uncertainty Reduction over Neural Representation","date":"2020-04-30","arxiv_id":"2004.14905","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modelling-suspense-in-short-stories-as#ran","syntology_url":"https://syntology.ai/paper/2004.14905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14905"}},"official":{"repos":["dwlmt/Story-Untangling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/investigating-transferability-in-pretrained","slug":"investigating-transferability-in-pretrained","title":"Investigating Transferability in Pretrained Language Models","date":"2020-04-30","arxiv_id":"2004.14975","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/investigating-transferability-in-pretrained#ran","syntology_url":"https://syntology.ai/paper/2004.14975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14975"}},"official":{"repos":["dgiova/bert-lm-transferability"],"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/revisiting-pre-trained-models-for-chinese","slug":"revisiting-pre-trained-models-for-chinese","title":"Revisiting Pre-Trained Models for Chinese Natural Language Processing","date":"2020-04-29","arxiv_id":"2004.13922","repositories_listed":6,"syntology":{"n":35,"n_ran":21,"n_constructed":1,"n_ran_checked":16,"n_instrument":5,"n_unverified":14,"n_honours":3,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"21 ran (of which 1 constructed an object rather than computing a result; 16 with no instrument failure: 3 honoured, 0 violated, 13 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/revisiting-pre-trained-models-for-chinese#ran","syntology_url":"https://syntology.ai/paper/2004.13922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13922"}},"official":{"repos":["ymcui/MacBERT"],"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/analysing-lexical-semantic-change-with","slug":"analysing-lexical-semantic-change-with","title":"Analysing Lexical Semantic Change with Contextualised Word Representations","date":"2020-04-29","arxiv_id":"2004.14118","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/analysing-lexical-semantic-change-with#ran","syntology_url":"https://syntology.ai/paper/2004.14118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.14118"}},"official":{"repos":["glnmario/cwr4lsc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-batch-normalized-inference-network-keeps","slug":"a-batch-normalized-inference-network-keeps","title":"A Batch Normalized Inference Network Keeps the KL Vanishing Away","date":"2020-04-27","arxiv_id":"2004.12585","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-batch-normalized-inference-network-keeps#ran","syntology_url":"https://syntology.ai/paper/2004.12585","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12585"}},"official":{"repos":["valdersoul/bn-vae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistically-masked-language-model","slug":"probabilistically-masked-language-model","title":"Probabilistically Masked Language Model Capable of Autoregressive Generation in Arbitrary Word Order","date":"2020-04-24","arxiv_id":"2004.11579","repositories_listed":3,"syntology":{"n":35,"n_ran":21,"n_constructed":1,"n_ran_checked":12,"n_instrument":9,"n_unverified":14,"n_honours":4,"n_violates":3,"n_no_contract":5,"n_pointer_only":29,"phrase":"21 ran (of which 1 constructed an object rather than computing a result; 12 with no instrument failure: 4 honoured, 3 violated, 5 with no contract checked; 9 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/probabilistically-masked-language-model#ran","syntology_url":"https://syntology.ai/paper/2004.11579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11579"}},"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":1,"n_ran_no_instrument_failure":8,"n_unverified":13,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/template-based-question-generation-from","slug":"template-based-question-generation-from","title":"Template-Based Question Generation from Retrieved Sentences for Improved Unsupervised Question Answering","date":"2020-04-24","arxiv_id":"2004.11892","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/template-based-question-generation-from#ran","syntology_url":"https://syntology.ai/paper/2004.11892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11892"}},"official":{"repos":["awslabs/unsupervised-qa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/train-no-evil-selective-masking-for-task","slug":"train-no-evil-selective-masking-for-task","title":"Train No Evil: Selective Masking for Task-Guided Pre-Training","date":"2020-04-21","arxiv_id":"2004.09733","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/train-no-evil-selective-masking-for-task#ran","syntology_url":"https://syntology.ai/paper/2004.09733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09733"}},"official":{"repos":["thunlp/SelectiveMasking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mpnet-masked-and-permuted-pre-training-for","slug":"mpnet-masked-and-permuted-pre-training-for","title":"MPNet: Masked and Permuted Pre-training for Language Understanding","date":"2020-04-20","arxiv_id":"2004.09297","repositories_listed":7,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mpnet-masked-and-permuted-pre-training-for#ran","syntology_url":"https://syntology.ai/paper/2004.09297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09297"}},"official":{"repos":["microsoft/MPNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transform-and-tell-entity-aware-news-image","slug":"transform-and-tell-entity-aware-news-image","title":"Transform and Tell: Entity-Aware News Image Captioning","date":"2020-04-17","arxiv_id":"2004.08070","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transform-and-tell-entity-aware-news-image#ran","syntology_url":"https://syntology.ai/paper/2004.08070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08070"}},"official":{"repos":["alasdairtran/transform-and-tell"],"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/tod-bert-pre-trained-natural-language","slug":"tod-bert-pre-trained-natural-language","title":"TOD-BERT: Pre-trained Natural Language Understanding for Task-Oriented Dialogue","date":"2020-04-15","arxiv_id":"2004.06871","repositories_listed":1,"syntology":{"n":13,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":13,"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) · 9 unverified","sample_list":"/paper/tod-bert-pre-trained-natural-language#ran","syntology_url":"https://syntology.ai/paper/2004.06871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06871"}},"official":{"repos":["jasonwu0731/ToD-BERT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/document-level-representation-learning-using","slug":"document-level-representation-learning-using","title":"SPECTER: Document-level Representation Learning using Citation-informed Transformers","date":"2020-04-15","arxiv_id":"2004.07180","repositories_listed":5,"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":1,"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/document-level-representation-learning-using#ran","syntology_url":"https://syntology.ai/paper/2004.07180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07180"}},"official":{"repos":["allenai/scidocs","allenai/specter"],"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":["official"]}}},{"url":"/paper/entities-as-experts-sparse-memory-access-with","slug":"entities-as-experts-sparse-memory-access-with","title":"Entities as Experts: Sparse Memory Access with Entity Supervision","date":"2020-04-15","arxiv_id":"2004.07202","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"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) · 3 unverified","sample_list":"/paper/entities-as-experts-sparse-memory-access-with#ran","syntology_url":"https://syntology.ai/paper/2004.07202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07202"}},"official":null}},{"url":"/paper/amr-parsing-via-graph-sequence-iterative","slug":"amr-parsing-via-graph-sequence-iterative","title":"AMR Parsing via Graph-Sequence Iterative Inference","date":"2020-04-12","arxiv_id":"2004.05572","repositories_listed":3,"syntology":{"n":31,"n_ran":21,"n_constructed":11,"n_ran_checked":16,"n_instrument":5,"n_unverified":10,"n_honours":1,"n_violates":1,"n_no_contract":14,"n_pointer_only":1,"phrase":"21 ran (of which 11 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 1 violated, 14 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/amr-parsing-via-graph-sequence-iterative#ran","syntology_url":"https://syntology.ai/paper/2004.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05572"}},"official":{"repos":["jcyk/AMR-gs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/unsupervised-commonsense-question-answering","slug":"unsupervised-commonsense-question-answering","title":"Unsupervised Commonsense Question Answering with Self-Talk","date":"2020-04-11","arxiv_id":"2004.05483","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/unsupervised-commonsense-question-answering#ran","syntology_url":"https://syntology.ai/paper/2004.05483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05483"}},"official":{"repos":["vered1986/self_talk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/longformer-the-long-document-transformer","slug":"longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","arxiv_id":"2004.05150","repositories_listed":22,"syntology":{"n":35,"n_ran":22,"n_constructed":4,"n_ran_checked":14,"n_instrument":8,"n_unverified":13,"n_honours":1,"n_violates":1,"n_no_contract":12,"n_pointer_only":5,"phrase":"22 ran (of which 4 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 8 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/longformer-the-long-document-transformer#ran","syntology_url":"https://syntology.ai/paper/2004.05150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05150"}},"official":{"repos":["allenai/longformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/exploring-versatile-generative-language-model","slug":"exploring-versatile-generative-language-model","title":"Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learning","date":"2020-04-08","arxiv_id":"2004.03829","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/exploring-versatile-generative-language-model#ran","syntology_url":"https://syntology.ai/paper/2004.03829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03829"}},"official":{"repos":["zlinao/VGLM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dynabert-dynamic-bert-with-adaptive-width-and","slug":"dynabert-dynamic-bert-with-adaptive-width-and","title":"DynaBERT: Dynamic BERT with Adaptive Width and Depth","date":"2020-04-08","arxiv_id":"2004.04037","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dynabert-dynamic-bert-with-adaptive-width-and#ran","syntology_url":"https://syntology.ai/paper/2004.04037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04037"}},"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/abstractive-text-summarization-based-on","slug":"abstractive-text-summarization-based-on","title":"Abstractive Text Summarization based on Language Model Conditioning and Locality Modeling","date":"2020-03-29","arxiv_id":"2003.13027","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abstractive-text-summarization-based-on#ran","syntology_url":"https://syntology.ai/paper/2003.13027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13027"}},"official":{"repos":["axenov/BERT-Summ-OpenNMT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/electra-pre-training-text-encoders-as-1","slug":"electra-pre-training-text-encoders-as-1","title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","date":"2020-03-23","arxiv_id":"2003.10555","repositories_listed":19,"syntology":{"n":40,"n_ran":31,"n_constructed":7,"n_ran_checked":18,"n_instrument":13,"n_unverified":9,"n_honours":2,"n_violates":2,"n_no_contract":14,"n_pointer_only":10,"phrase":"31 ran (of which 7 constructed an object rather than computing a result; 18 with no instrument failure: 2 honoured, 2 violated, 14 with no contract checked; 13 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/electra-pre-training-text-encoders-as-1#ran","syntology_url":"https://syntology.ai/paper/2003.10555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10555"}},"official":{"repos":["google-research/electra"],"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/efficient-content-based-sparse-attention-with-1","slug":"efficient-content-based-sparse-attention-with-1","title":"Efficient Content-Based Sparse Attention with Routing Transformers","date":"2020-03-12","arxiv_id":"2003.05997","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":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-content-based-sparse-attention-with-1#ran","syntology_url":"https://syntology.ai/paper/2003.05997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05997"}},"official":null}},{"url":"/paper/rezero-is-all-you-need-fast-convergence-at","slug":"rezero-is-all-you-need-fast-convergence-at","title":"ReZero is All You Need: Fast Convergence at Large Depth","date":"2020-03-10","arxiv_id":"2003.04887","repositories_listed":13,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rezero-is-all-you-need-fast-convergence-at#ran","syntology_url":"https://syntology.ai/paper/2003.04887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04887"}},"official":{"repos":["majumderb/rezero"],"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/progen-language-modeling-for-protein","slug":"progen-language-modeling-for-protein","title":"ProGen: Language Modeling for Protein Generation","date":"2020-03-08","arxiv_id":"2004.03497","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":2,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/progen-language-modeling-for-protein#ran","syntology_url":"https://syntology.ai/paper/2004.03497","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03497"}},"official":null}},{"url":"/paper/talking-heads-attention","slug":"talking-heads-attention","title":"Talking-Heads Attention","date":"2020-03-05","arxiv_id":"2003.02436","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/talking-heads-attention#ran","syntology_url":"https://syntology.ai/paper/2003.02436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02436"}},"official":{"repos":["zygmuntz/hyperband"],"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/data-augmentation-using-pre-trained","slug":"data-augmentation-using-pre-trained","title":"Data Augmentation using Pre-trained Transformer Models","date":"2020-03-04","arxiv_id":"2003.02245","repositories_listed":4,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/data-augmentation-using-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2003.02245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02245"}},"official":{"repos":["varinf/TransformersDataAugmentation"],"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/unilmv2-pseudo-masked-language-models-for","slug":"unilmv2-pseudo-masked-language-models-for","title":"UniLMv2: Pseudo-Masked Language Models for Unified Language Model Pre-Training","date":"2020-02-28","arxiv_id":"2002.12804","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unilmv2-pseudo-masked-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2002.12804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12804"}},"official":{"repos":["microsoft/unilm"],"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/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/200302645","slug":"200302645","title":"SentenceMIM: A Latent Variable Language Model","date":"2020-02-18","arxiv_id":"2003.02645","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/200302645#ran","syntology_url":"https://syntology.ai/paper/2003.02645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02645"}},"official":null}},{"url":"/paper/univilm-a-unified-video-and-language-pre","slug":"univilm-a-unified-video-and-language-pre","title":"UniVL: A Unified Video and Language Pre-Training Model for Multimodal Understanding and Generation","date":"2020-02-15","arxiv_id":"2002.06353","repositories_listed":2,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/univilm-a-unified-video-and-language-pre#ran","syntology_url":"https://syntology.ai/paper/2002.06353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06353"}},"official":{"repos":["microsoft/UniVL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/realm-retrieval-augmented-language-model-pre","slug":"realm-retrieval-augmented-language-model-pre","title":"REALM: Retrieval-Augmented Language Model Pre-Training","date":"2020-02-10","arxiv_id":"2002.08909","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/realm-retrieval-augmented-language-model-pre#ran","syntology_url":"https://syntology.ai/paper/2002.08909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08909"}},"official":{"repos":["google-research/language"],"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/blank-language-models","slug":"blank-language-models","title":"Blank Language Models","date":"2020-02-08","arxiv_id":"2002.03079","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/blank-language-models#ran","syntology_url":"https://syntology.ai/paper/2002.03079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03079"}},"official":{"repos":["Varal7/blank_language_model"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/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/parsing-as-pretraining","slug":"parsing-as-pretraining","title":"Parsing as Pretraining","date":"2020-02-05","arxiv_id":"2002.01685","repositories_listed":2,"syntology":{"n":30,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":14,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":17,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/parsing-as-pretraining#ran","syntology_url":"https://syntology.ai/paper/2002.01685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01685"}},"official":{"repos":["aghie/parsing-as-pretraining"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/scaling-laws-for-neural-language-models","slug":"scaling-laws-for-neural-language-models","title":"Scaling Laws for Neural Language Models","date":"2020-01-23","arxiv_id":"2001.08361","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/scaling-laws-for-neural-language-models#ran","syntology_url":"https://syntology.ai/paper/2001.08361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08361"}},"official":null}},{"url":"/paper/robbert-a-dutch-roberta-based-language-model","slug":"robbert-a-dutch-roberta-based-language-model","title":"RobBERT: a Dutch RoBERTa-based Language Model","date":"2020-01-17","arxiv_id":"2001.06286","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/robbert-a-dutch-roberta-based-language-model#ran","syntology_url":"https://syntology.ai/paper/2001.06286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06286"}},"official":{"repos":["iPieter/RobBERT"],"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/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/bertje-a-dutch-bert-model","slug":"bertje-a-dutch-bert-model","title":"BERTje: A Dutch BERT Model","date":"2019-12-19","arxiv_id":"1912.09582","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bertje-a-dutch-bert-model#ran","syntology_url":"https://syntology.ai/paper/1912.09582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09582"}},"official":{"repos":["wietsedv/bertje"],"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/flaubert-unsupervised-language-model-pre","slug":"flaubert-unsupervised-language-model-pre","title":"FlauBERT: Unsupervised Language Model Pre-training for French","date":"2019-12-11","arxiv_id":"1912.05372","repositories_listed":7,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/flaubert-unsupervised-language-model-pre#ran","syntology_url":"https://syntology.ai/paper/1912.05372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05372"}},"official":{"repos":["getalp/Flaubert"],"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/pythia-ai-assisted-code-completion-system","slug":"pythia-ai-assisted-code-completion-system","title":"Pythia: AI-assisted Code Completion System","date":"2019-11-29","arxiv_id":"1912.00742","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pythia-ai-assisted-code-completion-system#ran","syntology_url":"https://syntology.ai/paper/1912.00742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00742"}},"official":{"repos":["Microsoft/PTVS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kepler-a-unified-model-for-knowledge","slug":"kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","arxiv_id":"1911.06136","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":5,"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/kepler-a-unified-model-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06136"}},"official":{"repos":["THU-KEG/KEPLER"],"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/smiles-transformer-pre-trained-molecular","slug":"smiles-transformer-pre-trained-molecular","title":"SMILES Transformer: Pre-trained Molecular Fingerprint for Low Data Drug Discovery","date":"2019-11-12","arxiv_id":"1911.04738","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/smiles-transformer-pre-trained-molecular#ran","syntology_url":"https://syntology.ai/paper/1911.04738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04738"}},"official":{"repos":["DSPsleeporg/smiles-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"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/unsupervised-cross-lingual-representation-1","slug":"unsupervised-cross-lingual-representation-1","title":"Unsupervised Cross-lingual Representation Learning at Scale","date":"2019-11-05","arxiv_id":"1911.02116","repositories_listed":35,"syntology":{"n":59,"n_ran":40,"n_constructed":13,"n_ran_checked":35,"n_instrument":5,"n_unverified":19,"n_honours":4,"n_violates":1,"n_no_contract":30,"n_pointer_only":52,"phrase":"40 ran (of which 13 constructed an object rather than computing a result; 35 with no instrument failure: 4 honoured, 1 violated, 30 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/unsupervised-cross-lingual-representation-1#ran","syntology_url":"https://syntology.ai/paper/1911.02116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02116"}},"official":{"repos":["facebookresearch/cc_net","facebookresearch/XLM"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/generalization-through-memorization-nearest","slug":"generalization-through-memorization-nearest","title":"Generalization through Memorization: Nearest Neighbor Language Models","date":"2019-11-01","arxiv_id":"1911.00172","repositories_listed":5,"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/generalization-through-memorization-nearest#ran","syntology_url":"https://syntology.ai/paper/1911.00172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00172"}},"official":{"repos":["urvashik/knnlm"],"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/multi-stage-document-ranking-with-bert","slug":"multi-stage-document-ranking-with-bert","title":"Multi-Stage Document Ranking with BERT","date":"2019-10-31","arxiv_id":"1910.14424","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-stage-document-ranking-with-bert#ran","syntology_url":"https://syntology.ai/paper/1910.14424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.14424"}},"official":null}},{"url":"/paper/pseudolikelihood-reranking-with-masked","slug":"pseudolikelihood-reranking-with-masked","title":"Masked Language Model Scoring","date":"2019-10-31","arxiv_id":"1910.14659","repositories_listed":6,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pseudolikelihood-reranking-with-masked#ran","syntology_url":"https://syntology.ai/paper/1910.14659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.14659"}},"official":{"repos":["awslabs/mlm-scoring"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/learning-deterministic-weighted-automata-with","slug":"learning-deterministic-weighted-automata-with","title":"Learning Deterministic Weighted Automata with Queries and Counterexamples","date":"2019-10-30","arxiv_id":"1910.13895","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/learning-deterministic-weighted-automata-with#ran","syntology_url":"https://syntology.ai/paper/1910.13895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13895"}},"official":{"repos":["tech-srl/weighted_lstar"],"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/on-the-cross-lingual-transferability-of","slug":"on-the-cross-lingual-transferability-of","title":"On the Cross-lingual Transferability of Monolingual Representations","date":"2019-10-25","arxiv_id":"1910.11856","repositories_listed":7,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":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/on-the-cross-lingual-transferability-of#ran","syntology_url":"https://syntology.ai/paper/1910.11856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11856"}},"official":{"repos":["deepmind/xquad"],"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/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/structured-pruning-of-large-language-models","slug":"structured-pruning-of-large-language-models","title":"Structured Pruning of Large Language Models","date":"2019-10-10","arxiv_id":"1910.04732","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 4 unverified","sample_list":"/paper/structured-pruning-of-large-language-models#ran","syntology_url":"https://syntology.ai/paper/1910.04732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04732"}},"official":{"repos":["asappresearch/flop"],"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/distilbert-a-distilled-version-of-bert","slug":"distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","arxiv_id":"1910.01108","repositories_listed":37,"syntology":{"n":27,"n_ran":21,"n_constructed":5,"n_ran_checked":13,"n_instrument":8,"n_unverified":6,"n_honours":3,"n_violates":1,"n_no_contract":9,"n_pointer_only":2,"phrase":"21 ran (of which 5 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 8 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/distilbert-a-distilled-version-of-bert#ran","syntology_url":"https://syntology.ai/paper/1910.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01108"}},"official":{"repos":["huggingface/swift-coreml-transformers","huggingface/transformers"],"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/structural-language-models-for-any-code","slug":"structural-language-models-for-any-code","title":"Structural Language Models of Code","date":"2019-09-30","arxiv_id":"1910.00577","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structural-language-models-for-any-code#ran","syntology_url":"https://syntology.ai/paper/1910.00577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00577"}},"official":{"repos":["tech-srl/slm-code-generation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/uniter-learning-universal-image-text-1","slug":"uniter-learning-universal-image-text-1","title":"UNITER: UNiversal Image-TExt Representation Learning","date":"2019-09-25","arxiv_id":"1909.11740","repositories_listed":7,"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":2,"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/uniter-learning-universal-image-text-1#ran","syntology_url":"https://syntology.ai/paper/1909.11740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11740"}},"official":{"repos":["ChenRocks/UNITER"],"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/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/megatron-lm-training-multi-billion-parameter","slug":"megatron-lm-training-multi-billion-parameter","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","date":"2019-09-17","arxiv_id":"1909.08053","repositories_listed":10,"syntology":{"n":47,"n_ran":12,"n_constructed":2,"n_ran_checked":7,"n_instrument":5,"n_unverified":35,"n_honours":4,"n_violates":0,"n_no_contract":3,"n_pointer_only":15,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 4 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 35 unverified","sample_list":"/paper/megatron-lm-training-multi-billion-parameter#ran","syntology_url":"https://syntology.ai/paper/1909.08053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08053"}},"official":{"repos":["NVIDIA/Megatron-LM"],"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/tree-transformer-integrating-tree-structures","slug":"tree-transformer-integrating-tree-structures","title":"Tree Transformer: Integrating Tree Structures into Self-Attention","date":"2019-09-14","arxiv_id":"1909.06639","repositories_listed":3,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tree-transformer-integrating-tree-structures#ran","syntology_url":"https://syntology.ai/paper/1909.06639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06639"}},"official":{"repos":["yaushian/Tree-Transformer"],"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/ctrl-a-conditional-transformer-language-model-1","slug":"ctrl-a-conditional-transformer-language-model-1","title":"CTRL: A Conditional Transformer Language Model for Controllable Generation","date":"2019-09-11","arxiv_id":"1909.05858","repositories_listed":8,"syntology":{"n":14,"n_ran":14,"n_constructed":3,"n_ran_checked":11,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"14 ran (of which 3 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ctrl-a-conditional-transformer-language-model-1#ran","syntology_url":"https://syntology.ai/paper/1909.05858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05858"}},"official":null}},{"url":"/paper/span-selection-pre-training-for-question","slug":"span-selection-pre-training-for-question","title":"Span Selection Pre-training for Question Answering","date":"2019-09-09","arxiv_id":"1909.04120","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/span-selection-pre-training-for-question#ran","syntology_url":"https://syntology.ai/paper/1909.04120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04120"}},"official":{"repos":["IBM/span-selection-pretraining"],"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/on-extractive-and-abstractive-neural-document","slug":"on-extractive-and-abstractive-neural-document","title":"On Extractive and Abstractive Neural Document Summarization with Transformer Language Models","date":"2019-09-07","arxiv_id":"1909.03186","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/on-extractive-and-abstractive-neural-document#ran","syntology_url":"https://syntology.ai/paper/1909.03186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03186"}},"official":null}},{"url":"/paper/kg-bert-bert-for-knowledge-graph-completion","slug":"kg-bert-bert-for-knowledge-graph-completion","title":"KG-BERT: BERT for Knowledge Graph Completion","date":"2019-09-07","arxiv_id":"1909.03193","repositories_listed":3,"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":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) · 1 unverified","sample_list":"/paper/kg-bert-bert-for-knowledge-graph-completion#ran","syntology_url":"https://syntology.ai/paper/1909.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03193"}},"official":{"repos":["yao8839836/kg-bert"],"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/lamal-language-modeling-is-all-you-need-for","slug":"lamal-language-modeling-is-all-you-need-for","title":"LAMOL: LAnguage MOdeling for Lifelong Language Learning","date":"2019-09-07","arxiv_id":"1909.03329","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/lamal-language-modeling-is-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/1909.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03329"}},"official":{"repos":["jojotenya/LAMOL"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantics-aware-bert-for-language","slug":"semantics-aware-bert-for-language","title":"Semantics-aware BERT for Language Understanding","date":"2019-09-05","arxiv_id":"1909.02209","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/semantics-aware-bert-for-language#ran","syntology_url":"https://syntology.ai/paper/1909.02209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02209"}},"official":{"repos":["cooelf/SemBERT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-equilibrium-models","slug":"deep-equilibrium-models","title":"Deep Equilibrium Models","date":"2019-09-03","arxiv_id":"1909.01377","repositories_listed":11,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/1909.01377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01377"}},"official":{"repos":["locuslab/deq"],"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/commonsense-knowledge-mining-from-pretrained","slug":"commonsense-knowledge-mining-from-pretrained","title":"Commonsense Knowledge Mining from Pretrained Models","date":"2019-09-02","arxiv_id":"1909.00505","repositories_listed":1,"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":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) · 1 unverified","sample_list":"/paper/commonsense-knowledge-mining-from-pretrained#ran","syntology_url":"https://syntology.ai/paper/1909.00505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00505"}},"official":null}},{"url":"/paper/adapt-or-get-left-behind-domain-adaptation","slug":"adapt-or-get-left-behind-domain-adaptation","title":"Adapt or Get Left Behind: Domain Adaptation through BERT Language Model Finetuning for Aspect-Target Sentiment Classification","date":"2019-08-30","arxiv_id":"1908.11860","repositories_listed":3,"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/adapt-or-get-left-behind-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1908.11860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11860"}},"official":{"repos":["deepopinion/domain-adapted-atsc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/finbert-financial-sentiment-analysis-with-pre","slug":"finbert-financial-sentiment-analysis-with-pre","title":"FinBERT: Financial Sentiment Analysis with Pre-trained Language Models","date":"2019-08-27","arxiv_id":"1908.10063","repositories_listed":3,"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":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) · 0 unverified","sample_list":"/paper/finbert-financial-sentiment-analysis-with-pre#ran","syntology_url":"https://syntology.ai/paper/1908.10063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10063"}},"official":null}},{"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/190807724","slug":"190807724","title":"Restricted Recurrent Neural Networks","date":"2019-08-21","arxiv_id":"1908.07724","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/190807724#ran","syntology_url":"https://syntology.ai/paper/1908.07724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07724"}},"official":{"repos":["diaoenmao/Restricted-Recurrent-Neural-Networks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-adversarial-triggers-for-nlp","slug":"universal-adversarial-triggers-for-nlp","title":"Universal Adversarial Triggers for Attacking and Analyzing NLP","date":"2019-08-20","arxiv_id":"1908.07125","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":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/universal-adversarial-triggers-for-nlp#ran","syntology_url":"https://syntology.ai/paper/1908.07125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07125"}},"official":{"repos":["Eric-Wallace/universal-triggers"],"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/lxmert-learning-cross-modality-encoder","slug":"lxmert-learning-cross-modality-encoder","title":"LXMERT: Learning Cross-Modality Encoder Representations from Transformers","date":"2019-08-20","arxiv_id":"1908.07490","repositories_listed":9,"syntology":{"n":15,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/lxmert-learning-cross-modality-encoder#ran","syntology_url":"https://syntology.ai/paper/1908.07490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07490"}},"official":{"repos":["airsplay/lxmert"],"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/predicting-3d-human-dynamics-from-video","slug":"predicting-3d-human-dynamics-from-video","title":"Predicting 3D Human Dynamics from Video","date":"2019-08-13","arxiv_id":"1908.04781","repositories_listed":1,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/predicting-3d-human-dynamics-from-video#ran","syntology_url":"https://syntology.ai/paper/1908.04781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04781"}},"official":{"repos":["jasonyzhang/phd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/taper-time-aware-patient-ehr-representation","slug":"taper-time-aware-patient-ehr-representation","title":"TAPER: Time-Aware Patient EHR Representation","date":"2019-08-11","arxiv_id":"1908.03971","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/taper-time-aware-patient-ehr-representation#ran","syntology_url":"https://syntology.ai/paper/1908.03971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03971"}},"official":{"repos":["sajaddarabi/TAPER","sajaddarabi/TAPER-EHR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/visualbert-a-simple-and-performant-baseline","slug":"visualbert-a-simple-and-performant-baseline","title":"VisualBERT: A Simple and Performant Baseline for Vision and Language","date":"2019-08-09","arxiv_id":"1908.03557","repositories_listed":10,"syntology":{"n":9,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"4 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/visualbert-a-simple-and-performant-baseline#ran","syntology_url":"https://syntology.ai/paper/1908.03557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03557"}},"official":null}},{"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/what-bert-is-not-lessons-from-a-new-suite-of","slug":"what-bert-is-not-lessons-from-a-new-suite-of","title":"What BERT is not: Lessons from a new suite of psycholinguistic diagnostics for language models","date":"2019-07-31","arxiv_id":"1907.13528","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/what-bert-is-not-lessons-from-a-new-suite-of#ran","syntology_url":"https://syntology.ai/paper/1907.13528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.13528"}},"official":{"repos":["aetting/lm-diagnostics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","repositories_listed":67,"syntology":{"n":48,"n_ran":37,"n_constructed":11,"n_ran_checked":36,"n_instrument":1,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":36,"n_pointer_only":24,"phrase":"37 ran (of which 11 constructed an object rather than computing a result; 36 with no instrument failure: 0 honoured, 0 violated, 36 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}},"official":{"repos":["pytorch/fairseq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/eli5-long-form-question-answering","slug":"eli5-long-form-question-answering","title":"ELI5: Long Form Question Answering","date":"2019-07-22","arxiv_id":"1907.09190","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":4,"phrase":"10 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/eli5-long-form-question-answering#ran","syntology_url":"https://syntology.ai/paper/1907.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.09190"}},"official":{"repos":["facebookresearch/ELI5"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-shuffle-exchange-networks-sequence","slug":"neural-shuffle-exchange-networks-sequence","title":"Neural Shuffle-Exchange Networks -- Sequence Processing in O(n log n) Time","date":"2019-07-18","arxiv_id":"1907.07897","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":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) · 1 unverified","sample_list":"/paper/neural-shuffle-exchange-networks-sequence#ran","syntology_url":"https://syntology.ai/paper/1907.07897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07897"}},"official":{"repos":["LUMII-Syslab/shuffle-exchange"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-memory-layers-with-product-keys","slug":"large-memory-layers-with-product-keys","title":"Large Memory Layers with Product Keys","date":"2019-07-10","arxiv_id":"1907.05242","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-memory-layers-with-product-keys#ran","syntology_url":"https://syntology.ai/paper/1907.05242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05242"}},"official":{"repos":["facebookresearch/XLM"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"b00c2857fdfd6ec2ce4f49e5212b5aaeb739e2f590bf5eb55dd880f3092aa1af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}