{"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":"/paper/read-verify-machine-reading-comprehension","title":"Read + Verify: Machine Reading Comprehension with Unanswerable Questions","arxiv_id":"1808.05759","date":"2018-08-17","proceeding":null,"authors":["Minghao Hu","Furu Wei","Yuxing Peng","Zhen Huang","Nan Yang","Dongsheng Li"],"abstract":"Machine reading comprehension with unanswerable questions aims to abstain\nfrom answering when no answer can be inferred. In addition to extract answers,\nprevious works usually predict an additional \"no-answer\" probability to detect\nunanswerable cases. However, they fail to validate the answerability of the\nquestion by verifying the legitimacy of the predicted answer. To address this\nproblem, we propose a novel read-then-verify system, which not only utilizes a\nneural reader to extract candidate answers and produce no-answer probabilities,\nbut also leverages an answer verifier to decide whether the predicted answer is\nentailed by the input snippets. Moreover, we introduce two auxiliary losses to\nhelp the reader better handle answer extraction as well as no-answer detection,\nand investigate three different architectures for the answer verifier. Our\nexperiments on the SQuAD 2.0 dataset show that our system achieves a score of\n74.2 F1 on the test set, achieving state-of-the-art results at the time of\nsubmission (Aug. 28th, 2018).","url_abs":"http://arxiv.org/abs/1808.05759v5","url_pdf":"http://arxiv.org/pdf/1808.05759v5.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"machine-reading-comprehension","task_name":"Machine Reading Comprehension"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/question-answering-on-squad20","task":"Question Answering","dataset":"SQuAD2.0","model":"Reinforced Mnemonic Reader + Answer Verifier (single model)","rank_in_archive_order":244,"of":286,"metrics":{"EM":"71.767","F1":"74.295"},"uses_additional_data":false},{"leaderboard":"/sota/question-answering-on-squad20-dev","task":"Question Answering","dataset":"SQuAD2.0 dev","model":"RMR + ELMo (Model-III)","rank_in_archive_order":11,"of":13,"metrics":{"EM":"72.3","F1":"74.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.05759","atlas_url":"https://app.syntology.ai/?focus=1808.05759","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.05759"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.05759\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.05759"},"call":"get_concepts_for_paper(arxiv_id=\"1808.05759\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"28be3d853070b723f469c06b3d4266c4a3c1dc1060b25fd0e721100e42dff46e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}