{"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/multi-passage-machine-reading-comprehension","title":"Multi-Passage Machine Reading Comprehension with Cross-Passage Answer Verification","arxiv_id":"1805.02220","date":"2018-05-06","proceeding":"ACL 2018 7","authors":["Yizhong Wang","Kai Liu","Jing Liu","wei he","Yajuan Lyu","Hua Wu","Sujian Li","Haifeng Wang"],"abstract":"Machine reading comprehension (MRC) on real web data usually requires the\nmachine to answer a question by analyzing multiple passages retrieved by search\nengine. Compared with MRC on a single passage, multi-passage MRC is more\nchallenging, since we are likely to get multiple confusing answer candidates\nfrom different passages. To address this problem, we propose an end-to-end\nneural model that enables those answer candidates from different passages to\nverify each other based on their content representations. Specifically, we\njointly train three modules that can predict the final answer based on three\nfactors: the answer boundary, the answer content and the cross-passage answer\nverification. The experimental results show that our method outperforms the\nbaseline by a large margin and achieves the state-of-the-art performance on the\nEnglish MS-MARCO dataset and the Chinese DuReader dataset, both of which are\ndesigned for MRC in real-world settings.","url_abs":"http://arxiv.org/abs/1805.02220v2","url_pdf":"http://arxiv.org/pdf/1805.02220v2.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-ms-marco","task":"Question Answering","dataset":"MS MARCO","model":"VNET","rank_in_archive_order":3,"of":4,"metrics":{"BLEU-1":"54.37","Rouge-L":"51.63"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.02220","atlas_url":"https://app.syntology.ai/?focus=1805.02220","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":"1805.02220"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.02220\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.02220"},"call":"get_concepts_for_paper(arxiv_id=\"1805.02220\")"}],"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":"80f9175acbd556562af41701c5d8ffcf14f0982b30999a17c0487488bfde425a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}