{"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/6","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":6,"pages_in_order":18,"rows_per_page":100,"rows":[501,600],"of":1760,"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","prev":"/task/reading-comprehension/papers/5","next":"/task/reading-comprehension/papers/7","papers":[{"url":"/paper/bipar-a-bilingual-parallel-dataset-for","slug":"bipar-a-bilingual-parallel-dataset-for","title":"BiPaR: A Bilingual Parallel Dataset for Multilingual and Cross-lingual Reading Comprehension on Novels","date":"2019-10-11","arxiv_id":"1910.05040","repositories_listed":1,"syntology":null},{"url":"/paper/find-or-classify-dual-strategy-for-slot-value","slug":"find-or-classify-dual-strategy-for-slot-value","title":"Find or Classify? Dual Strategy for Slot-Value Predictions on Multi-Domain Dialog State Tracking","date":"2019-10-08","arxiv_id":"1910.03544","repositories_listed":1,"syntology":null},{"url":"/paper/allennlp-interpret-a-framework-for-explaining","slug":"allennlp-interpret-a-framework-for-explaining","title":"AllenNLP Interpret: A Framework for Explaining Predictions of NLP Models","date":"2019-09-19","arxiv_id":"1909.09251","repositories_listed":1,"syntology":null},{"url":"/paper/look-read-and-enrich-learning-from-scientific","slug":"look-read-and-enrich-learning-from-scientific","title":"Look, Read and Enrich. Learning from Scientific Figures and their Captions","date":"2019-09-19","arxiv_id":"1909.09070","repositories_listed":1,"syntology":null},{"url":"/paper/whats-missing-a-knowledge-gap-guided-approach","slug":"whats-missing-a-knowledge-gap-guided-approach","title":"What's Missing: A Knowledge Gap Guided Approach for Multi-hop Question Answering","date":"2019-09-19","arxiv_id":"1909.09253","repositories_listed":1,"syntology":null},{"url":"/paper/picture-what-you-read","slug":"picture-what-you-read","title":"Picture What you Read","date":"2019-09-09","arxiv_id":"1909.05663","repositories_listed":1,"syntology":null},{"url":"/paper/question-generation-by-transformers","slug":"question-generation-by-transformers","title":"Question Generation by Transformers","date":"2019-09-09","arxiv_id":"1909.05017","repositories_listed":1,"syntology":{"n":14,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/question-generation-by-transformers#ran","syntology_url":"https://syntology.ai/paper/1909.05017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05017"}},"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/symmetric-regularization-based-bert-for-pair","slug":"symmetric-regularization-based-bert-for-pair","title":"Symmetric Regularization based BERT for Pair-wise Semantic Reasoning","date":"2019-09-08","arxiv_id":"1909.03405","repositories_listed":1,"syntology":null},{"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/cross-lingual-machine-reading-comprehension","slug":"cross-lingual-machine-reading-comprehension","title":"Cross-Lingual Machine Reading Comprehension","date":"2019-09-01","arxiv_id":"1909.00361","repositories_listed":1,"syntology":null},{"url":"/paper/qainfomax-learning-robust-question-answering","slug":"qainfomax-learning-robust-question-answering","title":"QAInfomax: Learning Robust Question Answering System by Mutual Information Maximization","date":"2019-08-31","arxiv_id":"1909.00215","repositories_listed":1,"syntology":null},{"url":"/paper/discourse-aware-semantic-self-attention-for","slug":"discourse-aware-semantic-self-attention-for","title":"Discourse-Aware Semantic Self-Attention for Narrative Reading Comprehension","date":"2019-08-28","arxiv_id":"1908.10721","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-language-learning-by-question","slug":"interactive-language-learning-by-question","title":"Interactive Language Learning by Question Answering","date":"2019-08-28","arxiv_id":"1908.10909","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/interactive-language-learning-by-question#ran","syntology_url":"https://syntology.ai/paper/1908.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10909"}},"official":{"repos":["xingdi-eric-yuan/qait_public"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/interactive-machine-comprehension-with","slug":"interactive-machine-comprehension-with","title":"Interactive Machine Comprehension with Information Seeking Agents","date":"2019-08-27","arxiv_id":"1908.10449","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interactive-machine-comprehension-with#ran","syntology_url":"https://syntology.ai/paper/1908.10449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10449"}},"official":{"repos":["xingdi-eric-yuan/imrc_public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"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/quoref-a-reading-comprehension-dataset-with","slug":"quoref-a-reading-comprehension-dataset-with","title":"Quoref: A Reading Comprehension Dataset with Questions Requiring Coreferential Reasoning","date":"2019-08-16","arxiv_id":"1908.05803","repositories_listed":1,"syntology":null},{"url":"/paper/a-multi-type-multi-span-network-for-reading","slug":"a-multi-type-multi-span-network-for-reading","title":"A Multi-Type Multi-Span Network for Reading Comprehension that Requires Discrete Reasoning","date":"2019-08-15","arxiv_id":"1908.05514","repositories_listed":1,"syntology":null},{"url":"/paper/flowdelta-modeling-flow-information-gain-in","slug":"flowdelta-modeling-flow-information-gain-in","title":"FlowDelta: Modeling Flow Information Gain in Reasoning for Conversational Machine Comprehension","date":"2019-08-14","arxiv_id":"1908.05117","repositories_listed":1,"syntology":null},{"url":"/paper/sg-net-syntax-guided-machine-reading","slug":"sg-net-syntax-guided-machine-reading","title":"SG-Net: Syntax-Guided Machine Reading Comprehension","date":"2019-08-14","arxiv_id":"1908.05147","repositories_listed":1,"syntology":null},{"url":"/paper/x-wikire-a-large-multilingual-resource-for","slug":"x-wikire-a-large-multilingual-resource-for","title":"X-WikiRE: A Large, Multilingual Resource for Relation Extraction as Machine Comprehension","date":"2019-08-14","arxiv_id":"1908.05111","repositories_listed":1,"syntology":null},{"url":"/paper/amazonqa-a-review-based-question-answering","slug":"amazonqa-a-review-based-question-answering","title":"AmazonQA: A Review-Based Question Answering Task","date":"2019-08-12","arxiv_id":"1908.04364","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-english-only-reading-comprehension","slug":"beyond-english-only-reading-comprehension","title":"Beyond English-Only Reading Comprehension: Experiments in Zero-Shot Multilingual Transfer for Bulgarian","date":"2019-08-05","arxiv_id":"1908.01519","repositories_listed":1,"syntology":null},{"url":"/paper/on-understanding-the-relation-between-expert","slug":"on-understanding-the-relation-between-expert","title":"On Understanding the Relation between Expert Annotations of Text Readability and Target Reader Comprehension","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphflow-exploiting-conversation-flow-with","slug":"graphflow-exploiting-conversation-flow-with","title":"GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension","date":"2019-07-31","arxiv_id":"1908.00059","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graphflow-exploiting-conversation-flow-with#ran","syntology_url":"https://syntology.ai/paper/1908.00059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00059"}},"official":{"repos":["hugochan/GraphFlow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/tackling-graphical-nlp-problems-with-graph","slug":"tackling-graphical-nlp-problems-with-graph","title":"Tackling Graphical NLP problems with Graph Recurrent Networks","date":"2019-07-13","arxiv_id":"1907.06142","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-pre-trained-language","slug":"enhancing-pre-trained-language","title":"Enhancing Pre-Trained Language Representations with Rich Knowledge for Machine Reading Comprehension","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/katecheo-a-portable-and-modular-system-for","slug":"katecheo-a-portable-and-modular-system-for","title":"Katecheo: A Portable and Modular System for Multi-Topic Question Answering","date":"2019-07-01","arxiv_id":"1907.00854","repositories_listed":1,"syntology":null},{"url":"/paper/xqa-a-cross-lingual-open-domain-question","slug":"xqa-a-cross-lingual-open-domain-question","title":"XQA: A Cross-lingual Open-domain Question Answering Dataset","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/equant-enhanced-question-answer-network","slug":"equant-enhanced-question-answer-network","title":"EQuANt (Enhanced Question Answer Network)","date":"2019-06-24","arxiv_id":"1907.00708","repositories_listed":1,"syntology":null},{"url":"/paper/be-consistent-improving-procedural-text-1","slug":"be-consistent-improving-procedural-text-1","title":"Be Consistent! Improving Procedural Text Comprehension using Label Consistency","date":"2019-06-21","arxiv_id":"1906.08942","repositories_listed":1,"syntology":null},{"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/e3-entailment-driven-extracting-and-editing","slug":"e3-entailment-driven-extracting-and-editing","title":"E3: Entailment-driven Extracting and Editing for Conversational Machine Reading","date":"2019-06-12","arxiv_id":"1906.05373","repositories_listed":1,"syntology":null},{"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/rankqa-neural-question-answering-with-answer","slug":"rankqa-neural-question-answering-with-answer","title":"RankQA: Neural Question Answering with Answer Re-Ranking","date":"2019-06-07","arxiv_id":"1906.03008","repositories_listed":1,"syntology":null},{"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/chid-a-large-scale-chinese-idiom-dataset-for","slug":"chid-a-large-scale-chinese-idiom-dataset-for","title":"ChID: A Large-scale Chinese IDiom Dataset for Cloze Test","date":"2019-06-04","arxiv_id":"1906.01265","repositories_listed":1,"syntology":null},{"url":"/paper/eidos-indra-delphi-from-free-text-to","slug":"eidos-indra-delphi-from-free-text-to","title":"Eidos, INDRA, \\& Delphi: From Free Text to Executable Causal Models","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/boolq-exploring-the-surprising-difficulty-of","slug":"boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","date":"2019-05-24","arxiv_id":"1905.10044","repositories_listed":1,"syntology":null},{"url":"/paper/multi-hop-reading-comprehension-via-deep","slug":"multi-hop-reading-comprehension-via-deep","title":"Multi-hop Reading Comprehension via Deep Reinforcement Learning based Document Traversal","date":"2019-05-23","arxiv_id":"1905.09438","repositories_listed":1,"syntology":null},{"url":"/paper/entity-relation-extraction-as-multi-turn","slug":"entity-relation-extraction-as-multi-turn","title":"Entity-Relation Extraction as Multi-Turn Question Answering","date":"2019-05-14","arxiv_id":"1905.05529","repositories_listed":1,"syntology":null},{"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/the-relational-processing-limits-of-classic","slug":"the-relational-processing-limits-of-classic","title":"The relational processing limits of classic and contemporary neural network models of language processing","date":"2019-05-12","arxiv_id":"1905.05708","repositories_listed":1,"syntology":null},{"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/probing-prior-knowledge-needed-in-challenging","slug":"probing-prior-knowledge-needed-in-challenging","title":"Investigating Prior Knowledge for Challenging Chinese Machine Reading Comprehension","date":"2019-04-21","arxiv_id":"1904.09679","repositories_listed":1,"syntology":null},{"url":"/paper/eliminet-a-model-for-eliminating-options-for-1","slug":"eliminet-a-model-for-eliminating-options-for-1","title":"ElimiNet: A Model for Eliminating Options for Reading Comprehension with Multiple Choice Questions","date":"2019-04-04","arxiv_id":"1904.02651","repositories_listed":1,"syntology":null},{"url":"/paper/190407640","slug":"190407640","title":"Medical device surveillance with electronic health records","date":"2019-04-03","arxiv_id":"1904.07640","repositories_listed":1,"syntology":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/sogou-machine-reading-comprehension-toolkit","slug":"sogou-machine-reading-comprehension-toolkit","title":"Sogou Machine Reading Comprehension Toolkit","date":"2019-03-28","arxiv_id":"1903.11848","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-conversation-generation-with","slug":"knowledge-aware-conversation-generation-with","title":"Knowledge Aware Conversation Generation with Explainable Reasoning over Augmented Graphs","date":"2019-03-25","arxiv_id":"1903.10245","repositories_listed":1,"syntology":null},{"url":"/paper/episodic-memory-reader-learning-what-to","slug":"episodic-memory-reader-learning-what-to","title":"Episodic Memory Reader: Learning What to Remember for Question Answering from Streaming Data","date":"2019-03-14","arxiv_id":"1903.06164","repositories_listed":1,"syntology":null},{"url":"/paper/evidence-sentence-extraction-for-machine","slug":"evidence-sentence-extraction-for-machine","title":"Evidence Sentence Extraction for Machine Reading Comprehension","date":"2019-02-23","arxiv_id":"1902.08852","repositories_listed":1,"syntology":null},{"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/review-conversational-reading-comprehension","slug":"review-conversational-reading-comprehension","title":"Review Conversational Reading Comprehension","date":"2019-02-03","arxiv_id":"1902.00821","repositories_listed":1,"syntology":null},{"url":"/paper/dream-a-challenge-dataset-and-models-for","slug":"dream-a-challenge-dataset-and-models-for","title":"DREAM: A Challenge Dataset and Models for Dialogue-Based Reading Comprehension","date":"2019-02-01","arxiv_id":"1902.00164","repositories_listed":1,"syntology":null},{"url":"/paper/are-you-tough-enough-framework-for-robustness","slug":"are-you-tough-enough-framework-for-robustness","title":"Are you tough enough? Framework for Robustness Validation of Machine Comprehension Systems","date":"2018-12-05","arxiv_id":"1812.02205","repositories_listed":1,"syntology":null},{"url":"/paper/multi-granularity-hierarchical-attention","slug":"multi-granularity-hierarchical-attention","title":"Multi-granularity hierarchical attention fusion networks for reading comprehension and question answering","date":"2018-11-29","arxiv_id":"1811.11934","repositories_listed":1,"syntology":null},{"url":"/paper/recurrently-controlled-recurrent-networks","slug":"recurrently-controlled-recurrent-networks","title":"Recurrently Controlled Recurrent Networks","date":"2018-11-24","arxiv_id":"1811.09786","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-argument-prediction-as-reading","slug":"implicit-argument-prediction-as-reading","title":"Implicit Argument Prediction as Reading Comprehension","date":"2018-11-08","arxiv_id":"1811.03554","repositories_listed":1,"syntology":null},{"url":"/paper/effective-subword-segmentation-for-text","slug":"effective-subword-segmentation-for-text","title":"Effective Subword Segmentation for Text Comprehension","date":"2018-11-06","arxiv_id":"1811.02364","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-explicit-paths-for-multi-hop","slug":"exploiting-explicit-paths-for-multi-hop","title":"Exploiting Explicit Paths for Multi-hop Reading Comprehension","date":"2018-11-02","arxiv_id":"1811.01127","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-opinion-question-generation","slug":"automatic-opinion-question-generation","title":"Automatic Opinion Question Generation","date":"2018-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-describe-phrases-with-local-and","slug":"learning-to-describe-phrases-with-local-and","title":"Learning to Describe Phrases with Local and Global Contexts","date":"2018-11-01","arxiv_id":"1811.00266","repositories_listed":1,"syntology":null},{"url":"/paper/improving-machine-reading-comprehension-with","slug":"improving-machine-reading-comprehension-with","title":"Improving Machine Reading Comprehension with General Reading Strategies","date":"2018-10-31","arxiv_id":"1810.13441","repositories_listed":1,"syntology":null},{"url":"/paper/are-you-tough-enough-framework-for-robustness-1","slug":"are-you-tough-enough-framework-for-robustness-1","title":"Are you tough enough? Framework for Robustness Validation of Machine Comprehension Systems","date":"2018-10-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-span-extraction-dataset-for-chinese-machine","slug":"a-span-extraction-dataset-for-chinese-machine","title":"A Span-Extraction Dataset for Chinese Machine Reading Comprehension","date":"2018-10-17","arxiv_id":"1810.07366","repositories_listed":1,"syntology":null},{"url":"/paper/u-net-machine-reading-comprehension-with","slug":"u-net-machine-reading-comprehension-with","title":"U-Net: Machine Reading Comprehension with Unanswerable Questions","date":"2018-10-12","arxiv_id":"1810.06638","repositories_listed":1,"syntology":null},{"url":"/paper/flowqa-grasping-flow-in-history-for","slug":"flowqa-grasping-flow-in-history-for","title":"FlowQA: Grasping Flow in History for Conversational Machine Comprehension","date":"2018-10-06","arxiv_id":"1810.06683","repositories_listed":1,"syntology":null},{"url":"/paper/entity-tracking-improves-cloze-style-reading","slug":"entity-tracking-improves-cloze-style-reading","title":"Entity Tracking Improves Cloze-style Reading Comprehension","date":"2018-10-05","arxiv_id":"1810.02891","repositories_listed":1,"syntology":null},{"url":"/paper/a-nil-aware-answer-extraction-framework-for","slug":"a-nil-aware-answer-extraction-framework-for","title":"A Nil-Aware Answer Extraction Framework for Question Answering","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/paragraph-level-neural-question-generation","slug":"paragraph-level-neural-question-generation","title":"Paragraph-level Neural Question Generation with Maxout Pointer and Gated Self-attention Networks","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ranking-paragraphs-for-improving-answer","slug":"ranking-paragraphs-for-improving-answer","title":"Ranking Paragraphs for Improving Answer Recall in Open-Domain Question Answering","date":"2018-10-01","arxiv_id":"1810.00494","repositories_listed":1,"syntology":null},{"url":"/paper/speed-reading-learning-to-read-forbackward","slug":"speed-reading-learning-to-read-forbackward","title":"Speed Reading: Learning to Read ForBackward via Shuttle","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-extractive-reading-comprehension","slug":"multilingual-extractive-reading-comprehension","title":"Multilingual Extractive Reading Comprehension by Runtime Machine Translation","date":"2018-09-10","arxiv_id":"1809.03275","repositories_listed":1,"syntology":null},{"url":"/paper/dual-ask-answer-network-for-machine-reading","slug":"dual-ask-answer-network-for-machine-reading","title":"Dual Ask-Answer Network for Machine Reading Comprehension","date":"2018-09-06","arxiv_id":"1809.01997","repositories_listed":1,"syntology":null},{"url":"/paper/question-answering-by-reasoning-across","slug":"question-answering-by-reasoning-across","title":"Question Answering by Reasoning Across Documents with Graph Convolutional Networks","date":"2018-08-29","arxiv_id":"1808.09920","repositories_listed":1,"syntology":null},{"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/what-makes-reading-comprehension-questions","slug":"what-makes-reading-comprehension-questions","title":"What Makes Reading Comprehension Questions Easier?","date":"2018-08-28","arxiv_id":"1808.09384","repositories_listed":1,"syntology":null},{"url":"/paper/comparing-attention-based-convolutional-and","slug":"comparing-attention-based-convolutional-and","title":"Comparing Attention-based Convolutional and Recurrent Neural Networks: Success and Limitations in Machine Reading Comprehension","date":"2018-08-27","arxiv_id":"1808.08744","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-attention-what-really-counts-in","slug":"hierarchical-attention-what-really-counts-in","title":"Hierarchical Attention: What Really Counts in Various NLP Tasks","date":"2018-08-10","arxiv_id":"1808.03728","repositories_listed":1,"syntology":null},{"url":"/paper/odsqa-open-domain-spoken-question-answering","slug":"odsqa-open-domain-spoken-question-answering","title":"ODSQA: Open-domain Spoken Question Answering Dataset","date":"2018-08-07","arxiv_id":"1808.02280","repositories_listed":1,"syntology":null},{"url":"/paper/learning-semantic-sentence-embeddings-using","slug":"learning-semantic-sentence-embeddings-using","title":"Learning Semantic Sentence Embeddings using Sequential Pair-wise Discriminator","date":"2018-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/repartitioning-of-the-complexwebquestions","slug":"repartitioning-of-the-complexwebquestions","title":"Repartitioning of the ComplexWebQuestions Dataset","date":"2018-07-25","arxiv_id":"1807.09623","repositories_listed":1,"syntology":null},{"url":"/paper/cnn-for-text-based-multiple-choice-question","slug":"cnn-for-text-based-multiple-choice-question","title":"CNN for Text-Based Multiple Choice Question Answering","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/denoising-distantly-supervised-open-domain","slug":"denoising-distantly-supervised-open-domain","title":"Denoising Distantly Supervised Open-Domain Question Answering","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/document-modeling-with-external-attention-for","slug":"document-modeling-with-external-attention-for","title":"Document Modeling with External Attention for Sentence Extraction","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/jack-the-reader-a-a-machine-reading-framework","slug":"jack-the-reader-a-a-machine-reading-framework","title":"Jack the Reader -- A Machine Reading Framework","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semantically-equivalent-adversarial-rules-for","slug":"semantically-equivalent-adversarial-rules-for","title":"Semantically Equivalent Adversarial Rules for Debugging NLP models","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/subword-augmented-embedding-for-cloze-reading","slug":"subword-augmented-embedding-for-cloze-reading","title":"Subword-augmented Embedding for Cloze Reading Comprehension","date":"2018-06-24","arxiv_id":"1806.09103","repositories_listed":1,"syntology":null},{"url":"/paper/a-co-matching-model-for-multi-choice-reading","slug":"a-co-matching-model-for-multi-choice-reading","title":"A Co-Matching Model for Multi-choice Reading Comprehension","date":"2018-06-11","arxiv_id":"1806.04068","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-search-in-long-documents-using","slug":"learning-to-search-in-long-documents-using","title":"Learning to Search in Long Documents Using Document Structure","date":"2018-06-09","arxiv_id":"1806.03529","repositories_listed":1,"syntology":null},{"url":"/paper/drcd-a-chinese-machine-reading-comprehension","slug":"drcd-a-chinese-machine-reading-comprehension","title":"DRCD: a Chinese Machine Reading Comprehension Dataset","date":"2018-06-04","arxiv_id":"1806.00920","repositories_listed":1,"syntology":null},{"url":"/paper/annotating-picture-description-task-responses","slug":"annotating-picture-description-task-responses","title":"Annotating picture description task responses for content analysis","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/estimating-linguistic-complexity-for-science","slug":"estimating-linguistic-complexity-for-science","title":"Estimating Linguistic Complexity for Science Texts","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/iucm-at-semeval-2018-task-11-similar-topic","slug":"iucm-at-semeval-2018-task-11-similar-topic","title":"IUCM at SemEval-2018 Task 11: Similar-Topic Texts as a Comprehension Knowledge Source","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"c6a6f20404f394be47287580f1975491c6277c73d427e9d3723a9b4a21055cff","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}