{"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/reading-comprehension/papers/ran/2","list_of":"/task/reading-comprehension","task":"Reading Comprehension","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,139],"of":139,"counts":{"archive_papers_tagged":1760,"with_a_code_link":634,"where_syntology_ran_a_sample":139,"not_listed_spam_title":0,"listed":1760,"listed_where_code_ran":139,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":120,"every_run_a_failure_of_syntologys_instrument":19,"listed_with_a_run_with_no_instrument_failure":120,"listed_every_run_a_failure_of_syntologys_instrument":19,"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/reading-comprehension/papers/ran/1","prev":"/task/reading-comprehension/papers/ran/1","next":null,"papers":[{"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/augmenting-neural-networks-with-first-order","slug":"augmenting-neural-networks-with-first-order","title":"Augmenting Neural Networks with First-order Logic","date":"2019-06-14","arxiv_id":"1906.06298","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/augmenting-neural-networks-with-first-order#ran","syntology_url":"https://syntology.ai/paper/1906.06298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06298"}},"official":{"repos":["utahnlp/layer_augmentation"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/explore-propose-and-assemble-an-interpretable","slug":"explore-propose-and-assemble-an-interpretable","title":"Explore, Propose, and Assemble: An Interpretable Model for Multi-Hop Reading Comprehension","date":"2019-06-12","arxiv_id":"1906.05210","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explore-propose-and-assemble-an-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.05210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05210"}},"official":{"repos":["jiangycTarheel/EPAr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-arabic-question-answering","slug":"neural-arabic-question-answering","title":"Neural Arabic Question Answering","date":"2019-06-12","arxiv_id":"1906.05394","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-arabic-question-answering#ran","syntology_url":"https://syntology.ai/paper/1906.05394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05394"}},"official":{"repos":["husseinmozannar/SOQAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/retrieve-read-rerank-towards-end-to-end-multi","slug":"retrieve-read-rerank-towards-end-to-end-multi","title":"Retrieve, Read, Rerank: Towards End-to-End Multi-Document Reading Comprehension","date":"2019-06-11","arxiv_id":"1906.04618","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":0,"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/retrieve-read-rerank-towards-end-to-end-multi#ran","syntology_url":"https://syntology.ai/paper/1906.04618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04618"}},"official":{"repos":["huminghao16/RE3QA"],"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/compositional-questions-do-not-necessitate","slug":"compositional-questions-do-not-necessitate","title":"Compositional Questions Do Not Necessitate Multi-hop Reasoning","date":"2019-06-07","arxiv_id":"1906.02900","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-questions-do-not-necessitate#ran","syntology_url":"https://syntology.ai/paper/1906.02900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02900"}},"official":{"repos":["shmsw25/single-hop-rc"],"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/multi-hop-reading-comprehension-through","slug":"multi-hop-reading-comprehension-through","title":"Multi-hop Reading Comprehension through Question Decomposition and Rescoring","date":"2019-06-07","arxiv_id":"1906.02916","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/multi-hop-reading-comprehension-through#ran","syntology_url":"https://syntology.ai/paper/1906.02916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02916"}},"official":{"repos":["shmsw25/DecompRC"],"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/conversing-by-reading-contentful-neural","slug":"conversing-by-reading-contentful-neural","title":"Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading","date":"2019-06-06","arxiv_id":"1906.02738","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/conversing-by-reading-contentful-neural#ran","syntology_url":"https://syntology.ai/paper/1906.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02738"}},"official":{"repos":["qkaren/converse_reading_cmr"],"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/multiqa-an-empirical-investigation-of","slug":"multiqa-an-empirical-investigation-of","title":"MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehension","date":"2019-05-31","arxiv_id":"1905.13453","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multiqa-an-empirical-investigation-of#ran","syntology_url":"https://syntology.ai/paper/1905.13453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13453"}},"official":{"repos":["alontalmor/multiqa"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cognitive-graph-for-multi-hop-reading","slug":"cognitive-graph-for-multi-hop-reading","title":"Cognitive Graph for Multi-Hop Reading Comprehension at Scale","date":"2019-05-14","arxiv_id":"1905.05460","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":2,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cognitive-graph-for-multi-hop-reading#ran","syntology_url":"https://syntology.ai/paper/1905.05460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05460"}},"official":{"repos":["THUDM/CogQA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/multi-step-retriever-reader-interaction-for-1","slug":"multi-step-retriever-reader-interaction-for-1","title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","date":"2019-05-14","arxiv_id":"1905.05733","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-step-retriever-reader-interaction-for-1#ran","syntology_url":"https://syntology.ai/paper/1905.05733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05733"}},"official":{"repos":["rajarshd/Multi-Step-Reasoning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/routing-networks-and-the-challenges-of","slug":"routing-networks-and-the-challenges-of","title":"Routing Networks and the Challenges of Modular and Compositional Computation","date":"2019-04-29","arxiv_id":"1904.12774","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/routing-networks-and-the-challenges-of#ran","syntology_url":"https://syntology.ai/paper/1904.12774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12774"}},"official":null}},{"url":"/paper/bert-post-training-for-review-reading","slug":"bert-post-training-for-review-reading","title":"BERT Post-Training for Review Reading Comprehension and Aspect-based Sentiment Analysis","date":"2019-04-03","arxiv_id":"1904.02232","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bert-post-training-for-review-reading#ran","syntology_url":"https://syntology.ai/paper/1904.02232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02232"}},"official":null}},{"url":"/paper/structural-scaffolds-for-citation-intent","slug":"structural-scaffolds-for-citation-intent","title":"Structural Scaffolds for Citation Intent Classification in Scientific Publications","date":"2019-04-02","arxiv_id":"1904.01608","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structural-scaffolds-for-citation-intent#ran","syntology_url":"https://syntology.ai/paper/1904.01608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01608"}},"official":{"repos":["allenai/scicite"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-open-domain-question-answering","slug":"end-to-end-open-domain-question-answering","title":"End-to-End Open-Domain Question Answering with BERTserini","date":"2019-02-05","arxiv_id":"1902.01718","repositories_listed":1,"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":3,"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/end-to-end-open-domain-question-answering#ran","syntology_url":"https://syntology.ai/paper/1902.01718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01718"}},"official":{"repos":["rsvp-ai/bertserini"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/commonsense-for-generative-multi-hop-question","slug":"commonsense-for-generative-multi-hop-question","title":"Commonsense for Generative Multi-Hop Question Answering Tasks","date":"2018-09-17","arxiv_id":"1809.06309","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/commonsense-for-generative-multi-hop-question#ran","syntology_url":"https://syntology.ai/paper/1809.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.06309"}},"official":{"repos":["yicheng-w/CommonSenseMultiHopQA"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reasoning-about-actions-and-state-changes-by","slug":"reasoning-about-actions-and-state-changes-by","title":"Reasoning about Actions and State Changes by Injecting Commonsense Knowledge","date":"2018-08-29","arxiv_id":"1808.10012","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/reasoning-about-actions-and-state-changes-by#ran","syntology_url":"https://syntology.ai/paper/1808.10012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10012"}},"official":{"repos":["allenai/propara"],"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/coqa-a-conversational-question-answering","slug":"coqa-a-conversational-question-answering","title":"CoQA: A Conversational Question Answering Challenge","date":"2018-08-21","arxiv_id":"1808.07042","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/coqa-a-conversational-question-answering#ran","syntology_url":"https://syntology.ai/paper/1808.07042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.07042"}},"official":null}},{"url":"/paper/qanet-combining-local-convolution-with-global","slug":"qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","arxiv_id":"1804.09541","repositories_listed":15,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/qanet-combining-local-convolution-with-global#ran","syntology_url":"https://syntology.ai/paper/1804.09541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.09541"}},"official":null}},{"url":"/paper/duorc-towards-complex-language-understanding","slug":"duorc-towards-complex-language-understanding","title":"DuoRC: Towards Complex Language Understanding with Paraphrased Reading Comprehension","date":"2018-04-21","arxiv_id":"1804.07927","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/duorc-towards-complex-language-understanding#ran","syntology_url":"https://syntology.ai/paper/1804.07927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07927"}},"official":{"repos":["duorc/duorc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/phrase-indexed-question-answering-a-new","slug":"phrase-indexed-question-answering-a-new","title":"Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension","date":"2018-04-20","arxiv_id":"1804.07726","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/phrase-indexed-question-answering-a-new#ran","syntology_url":"https://syntology.ai/paper/1804.07726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07726"}},"official":{"repos":["uwnlp/piqa"],"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":["official"]}}},{"url":"/paper/clicr-a-dataset-of-clinical-case-reports-for","slug":"clicr-a-dataset-of-clinical-case-reports-for","title":"CliCR: A Dataset of Clinical Case Reports for Machine Reading Comprehension","date":"2018-03-26","arxiv_id":"1803.09720","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":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/clicr-a-dataset-of-clinical-case-reports-for#ran","syntology_url":"https://syntology.ai/paper/1803.09720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09720"}},"official":{"repos":["clips/clicr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/evidence-aggregation-for-answer-re-ranking-in","slug":"evidence-aggregation-for-answer-re-ranking-in","title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering","date":"2017-11-14","arxiv_id":"1711.05116","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evidence-aggregation-for-answer-re-ranking-in#ran","syntology_url":"https://syntology.ai/paper/1711.05116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05116"}},"official":{"repos":["shuohangwang/mprc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-and-effective-multi-paragraph-reading","slug":"simple-and-effective-multi-paragraph-reading","title":"Simple and Effective Multi-Paragraph Reading Comprehension","date":"2017-10-29","arxiv_id":"1710.10723","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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) · 2 unverified","sample_list":"/paper/simple-and-effective-multi-paragraph-reading#ran","syntology_url":"https://syntology.ai/paper/1710.10723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10723"}},"official":{"repos":["allenai/document-qa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/triviaqa-a-large-scale-distantly-supervised","slug":"triviaqa-a-large-scale-distantly-supervised","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","date":"2017-05-09","arxiv_id":"1705.03551","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/triviaqa-a-large-scale-distantly-supervised#ran","syntology_url":"https://syntology.ai/paper/1705.03551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.03551"}},"official":null}},{"url":"/paper/reading-wikipedia-to-answer-open-domain","slug":"reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","repositories_listed":10,"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/reading-wikipedia-to-answer-open-domain#ran","syntology_url":"https://syntology.ai/paper/1704.00051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.00051"}},"official":{"repos":["facebookresearch/DrQA"],"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/making-neural-qa-as-simple-as-possible-but","slug":"making-neural-qa-as-simple-as-possible-but","title":"Making Neural QA as Simple as Possible but not Simpler","date":"2017-03-14","arxiv_id":"1703.04816","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/making-neural-qa-as-simple-as-possible-but#ran","syntology_url":"https://syntology.ai/paper/1703.04816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04816"}},"official":null}},{"url":"/paper/ms-marco-a-human-generated-machine-reading","slug":"ms-marco-a-human-generated-machine-reading","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","date":"2016-11-28","arxiv_id":"1611.09268","repositories_listed":14,"syntology":{"n":33,"n_ran":28,"n_constructed":0,"n_ran_checked":27,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":27,"n_pointer_only":0,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 27 with no instrument failure: 0 honoured, 0 violated, 27 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ms-marco-a-human-generated-machine-reading#ran","syntology_url":"https://syntology.ai/paper/1611.09268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09268"}},"official":null}},{"url":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","repositories_listed":27,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":7,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}},"official":{"repos":["allenai/bi-att-flow"],"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/gated-end-to-end-memory-networks","slug":"gated-end-to-end-memory-networks","title":"Gated End-to-End Memory Networks","date":"2016-10-13","arxiv_id":"1610.04211","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/gated-end-to-end-memory-networks#ran","syntology_url":"https://syntology.ai/paper/1610.04211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.04211"}},"official":null}},{"url":"/paper/machine-comprehension-using-match-lstm-and","slug":"machine-comprehension-using-match-lstm-and","title":"Machine Comprehension Using Match-LSTM and Answer Pointer","date":"2016-08-29","arxiv_id":"1608.07905","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/machine-comprehension-using-match-lstm-and#ran","syntology_url":"https://syntology.ai/paper/1608.07905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.07905"}},"official":{"repos":["shuohangwang/SeqMatchSeq"],"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/squad-100000-questions-for-machine","slug":"squad-100000-questions-for-machine","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","date":"2016-06-16","arxiv_id":"1606.05250","repositories_listed":21,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/squad-100000-questions-for-machine#ran","syntology_url":"https://syntology.ai/paper/1606.05250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.05250"}},"official":{"repos":["worksheets.codalab.org/worksheets/0xd53d03a48ef64b329c16b9baf0f99b0c"],"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/gated-attention-readers-for-text","slug":"gated-attention-readers-for-text","title":"Gated-Attention Readers for Text Comprehension","date":"2016-06-05","arxiv_id":"1606.01549","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gated-attention-readers-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01549"}},"official":{"repos":["bdhingra/ga-reader"],"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/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}},"official":null}},{"url":"/paper/text-understanding-with-the-attention-sum","slug":"text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","arxiv_id":"1603.01547","repositories_listed":2,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/text-understanding-with-the-attention-sum#ran","syntology_url":"https://syntology.ai/paper/1603.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01547"}},"official":{"repos":["rkadlec/asreader"],"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/long-short-term-memory-networks-for-machine","slug":"long-short-term-memory-networks-for-machine","title":"Long Short-Term Memory-Networks for Machine Reading","date":"2016-01-25","arxiv_id":"1601.06733","repositories_listed":3,"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":2,"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/long-short-term-memory-networks-for-machine#ran","syntology_url":"https://syntology.ai/paper/1601.06733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.06733"}},"official":null}},{"url":"/paper/listen-attend-and-spell","slug":"listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","arxiv_id":"1508.01211","repositories_listed":40,"syntology":{"n":51,"n_ran":30,"n_constructed":0,"n_ran_checked":20,"n_instrument":10,"n_unverified":21,"n_honours":1,"n_violates":1,"n_no_contract":18,"n_pointer_only":9,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 1 violated, 18 with no contract checked; 10 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/listen-attend-and-spell#ran","syntology_url":"https://syntology.ai/paper/1508.01211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01211"}},"official":null}},{"url":"/paper/teaching-machines-to-read-and-comprehend","slug":"teaching-machines-to-read-and-comprehend","title":"Teaching Machines to Read and Comprehend","date":"2015-06-10","arxiv_id":"1506.03340","repositories_listed":12,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/teaching-machines-to-read-and-comprehend#ran","syntology_url":"https://syntology.ai/paper/1506.03340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.03340"}},"official":{"repos":["deepmind/rc-data"],"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/towards-ai-complete-question-answering-a-set","slug":"towards-ai-complete-question-answering-a-set","title":"Towards AI-Complete Question Answering: A Set of Prerequisite Toy Tasks","date":"2015-02-19","arxiv_id":"1502.05698","repositories_listed":20,"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":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) · 2 unverified","sample_list":"/paper/towards-ai-complete-question-answering-a-set#ran","syntology_url":"https://syntology.ai/paper/1502.05698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05698"}},"official":{"repos":["facebook/bAbI-tasks"],"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":"d675f630e1d5b3d5313f011b148a3ef30b514223568b600a9a8f8f750fe6ea2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}