{"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/paraphrase-identification/papers/ran/1","list_of":"/task/paraphrase-identification","task":"Paraphrase Identification","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,22],"of":22,"counts":{"archive_papers_tagged":172,"with_a_code_link":76,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":172,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/paraphrase-identification/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/do-multilingual-language-models-think-better","slug":"do-multilingual-language-models-think-better","title":"Do Multilingual Language Models Think Better in English?","date":"2023-08-02","arxiv_id":"2308.01223","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/do-multilingual-language-models-think-better#ran","syntology_url":"https://syntology.ai/paper/2308.01223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.01223"}},"official":{"repos":["juletx/self-translate"],"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/scaling-instruction-finetuned-language-models","slug":"scaling-instruction-finetuned-language-models","title":"Scaling Instruction-Finetuned Language Models","date":"2022-10-20","arxiv_id":"2210.11416","repositories_listed":9,"syntology":{"n":17,"n_ran":8,"n_constructed":1,"n_ran_checked":1,"n_instrument":7,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"8 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; 7 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/scaling-instruction-finetuned-language-models#ran","syntology_url":"https://syntology.ai/paper/2210.11416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11416"}},"official":null}},{"url":"/paper/gapx-generalized-autoregressive-paraphrase","slug":"gapx-generalized-autoregressive-paraphrase","title":"GAPX: Generalized Autoregressive Paraphrase-Identification X","date":"2022-10-05","arxiv_id":"2210.01979","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":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/gapx-generalized-autoregressive-paraphrase#ran","syntology_url":"https://syntology.ai/paper/2210.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01979"}},"official":{"repos":["yifeizhou02/generalized_paraphrase_identification"],"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/data2vec-a-general-framework-for-self-1","slug":"data2vec-a-general-framework-for-self-1","title":"data2vec: A General Framework for Self-supervised Learning in Speech, Vision and Language","date":"2022-02-07","arxiv_id":"2202.03555","repositories_listed":12,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/data2vec-a-general-framework-for-self-1#ran","syntology_url":"https://syntology.ai/paper/2202.03555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03555"}},"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/charformer-fast-character-transformers-via","slug":"charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","arxiv_id":"2106.12672","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":3,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/charformer-fast-character-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2106.12672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12672"}},"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/fnet-mixing-tokens-with-fourier-transforms","slug":"fnet-mixing-tokens-with-fourier-transforms","title":"FNet: Mixing Tokens with Fourier Transforms","date":"2021-05-09","arxiv_id":"2105.03824","repositories_listed":12,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fnet-mixing-tokens-with-fourier-transforms#ran","syntology_url":"https://syntology.ai/paper/2105.03824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03824"}},"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/entailment-as-few-shot-learner","slug":"entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","arxiv_id":"2104.14690","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/entailment-as-few-shot-learner#ran","syntology_url":"https://syntology.ai/paper/2104.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14690"}},"official":null}},{"url":"/paper/tsdae-using-transformer-based-sequential","slug":"tsdae-using-transformer-based-sequential","title":"TSDAE: Using Transformer-based Sequential Denoising Auto-Encoder for Unsupervised Sentence Embedding Learning","date":"2021-04-14","arxiv_id":"2104.06979","repositories_listed":6,"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/tsdae-using-transformer-based-sequential#ran","syntology_url":"https://syntology.ai/paper/2104.06979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06979"}},"official":{"repos":["kwang2049/pytorch-bertflow","kwang2049/useb","ukplab/pytorch-bertflow"],"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/explaining-neural-network-predictions-on","slug":"explaining-neural-network-predictions-on","title":"Explaining Neural Network Predictions on Sentence Pairs via Learning Word-Group Masks","date":"2021-04-09","arxiv_id":"2104.04488","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":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/explaining-neural-network-predictions-on#ran","syntology_url":"https://syntology.ai/paper/2104.04488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04488"}},"official":{"repos":["UVa-NLP/GMASK"],"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/intrinsic-dimensionality-explains-the","slug":"intrinsic-dimensionality-explains-the","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","date":"2020-12-22","arxiv_id":"2012.13255","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intrinsic-dimensionality-explains-the#ran","syntology_url":"https://syntology.ai/paper/2012.13255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.13255"}},"official":{"repos":["rabeehk/compacter"],"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/smart-robust-and-efficient-fine-tuning-for","slug":"smart-robust-and-efficient-fine-tuning-for","title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","date":"2019-11-08","arxiv_id":"1911.03437","repositories_listed":6,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/smart-robust-and-efficient-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1911.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03437"}},"official":{"repos":["namisan/mt-dnn"],"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/dice-loss-for-data-imbalanced-nlp-tasks","slug":"dice-loss-for-data-imbalanced-nlp-tasks","title":"Dice Loss for Data-imbalanced NLP Tasks","date":"2019-11-07","arxiv_id":"1911.02855","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dice-loss-for-data-imbalanced-nlp-tasks#ran","syntology_url":"https://syntology.ai/paper/1911.02855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02855"}},"official":{"repos":["ShannonAI/dice_loss_for_NLP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-effective-text-matching-with-1","slug":"simple-and-effective-text-matching-with-1","title":"Simple and Effective Text Matching with Richer Alignment Features","date":"2019-08-01","arxiv_id":"1908.00300","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-and-effective-text-matching-with-1#ran","syntology_url":"https://syntology.ai/paper/1908.00300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00300"}},"official":{"repos":["hitvoice/RE2"],"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/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","repositories_listed":6,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"9 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}},"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","repositories_listed":27,"syntology":{"n":24,"n_ran":15,"n_constructed":2,"n_ran_checked":10,"n_instrument":5,"n_unverified":9,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"15 ran (of which 2 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}},"official":{"repos":["zihangdai/xlnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ernie-enhanced-language-representation-with","slug":"ernie-enhanced-language-representation-with","title":"ERNIE: Enhanced Language Representation with Informative Entities","date":"2019-05-17","arxiv_id":"1905.07129","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ernie-enhanced-language-representation-with#ran","syntology_url":"https://syntology.ai/paper/1905.07129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07129"}},"official":{"repos":["thunlp/ERNIE"],"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","unlocated"]}}},{"url":"/paper/multi-task-deep-neural-networks-for-natural","slug":"multi-task-deep-neural-networks-for-natural","title":"Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2019-01-31","arxiv_id":"1901.11504","repositories_listed":7,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multi-task-deep-neural-networks-for-natural#ran","syntology_url":"https://syntology.ai/paper/1901.11504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11504"}},"official":{"repos":["namisan/mt-dnn"],"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/bert-pre-training-of-deep-bidirectional","slug":"bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","arxiv_id":"1810.04805","repositories_listed":534,"syntology":{"n":659,"n_ran":300,"n_constructed":75,"n_ran_checked":235,"n_instrument":65,"n_unverified":359,"n_honours":17,"n_violates":4,"n_no_contract":214,"n_pointer_only":164,"phrase":"300 ran (of which 75 constructed an object rather than computing a result; 235 with no instrument failure: 17 honoured, 4 violated, 214 with no contract checked; 65 where Syntology's instrument failed) · 359 unverified","sample_list":"/paper/bert-pre-training-of-deep-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1810.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04805"}},"official":{"repos":["google-research/bert"],"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/neural-network-models-for-paraphrase","slug":"neural-network-models-for-paraphrase","title":"Neural Network Models for Paraphrase Identification, Semantic Textual Similarity, Natural Language Inference, and Question Answering","date":"2018-06-12","arxiv_id":"1806.04330","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/neural-network-models-for-paraphrase#ran","syntology_url":"https://syntology.ai/paper/1806.04330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04330"}},"official":{"repos":["lanwuwei/SPM_toolkit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-general-purpose-distributed-sentence","slug":"learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","arxiv_id":"1804.00079","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-general-purpose-distributed-sentence#ran","syntology_url":"https://syntology.ai/paper/1804.00079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00079"}},"official":{"repos":["facebookresearch/SentEval","Maluuba/gensen"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/natural-language-inference-over-interaction-1","slug":"natural-language-inference-over-interaction-1","title":"Natural Language Inference over Interaction Space","date":"2017-09-13","arxiv_id":"1709.04348","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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/natural-language-inference-over-interaction-1#ran","syntology_url":"https://syntology.ai/paper/1709.04348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.04348"}},"official":{"repos":["YichenGong/Densely-Interactive-Inference-Network"],"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/bilateral-multi-perspective-matching-for","slug":"bilateral-multi-perspective-matching-for","title":"Bilateral Multi-Perspective Matching for Natural Language Sentences","date":"2017-02-13","arxiv_id":"1702.03814","repositories_listed":10,"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/bilateral-multi-perspective-matching-for#ran","syntology_url":"https://syntology.ai/paper/1702.03814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.03814"}},"official":null}}],"record_sha256":"363d1e7fda76bef995cf52cd22d7a4f0d5ac5ea4a838512ba6b4238fcfd93cea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}