{"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/option-comparison-network-for-multiple-choice","title":"Option Comparison Network for Multiple-choice Reading Comprehension","arxiv_id":"1903.03033","date":"2019-03-07","proceeding":null,"authors":["Qiu Ran","Peng Li","Weiwei Hu","Jie zhou"],"abstract":"Multiple-choice reading comprehension (MCRC) is the task of selecting the\ncorrect answer from multiple options given a question and an article. Existing\nMCRC models typically either read each option independently or compute a\nfixed-length representation for each option before comparing them. However,\nhumans typically compare the options at multiple-granularity level before\nreading the article in detail to make reasoning more efficient. Mimicking\nhumans, we propose an option comparison network (OCN) for MCRC which compares\noptions at word-level to better identify their correlations to help reasoning.\nSpecially, each option is encoded into a vector sequence using a skimmer to\nretain fine-grained information as much as possible. An attention mechanism is\nleveraged to compare these sequences vector-by-vector to identify more subtle\ncorrelations between options, which is potentially valuable for reasoning.\nExperimental results on the human English exam MCRC dataset RACE show that our\nmodel outperforms existing methods significantly. Moreover, it is also the\nfirst model that surpasses Amazon Mechanical Turker performance on the whole\ndataset.","url_abs":"http://arxiv.org/abs/1903.03033v1","url_pdf":"http://arxiv.org/pdf/1903.03033v1.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":"multiple-choice","task_name":"Multiple-choice"},{"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-race","task":"Question Answering","dataset":"RACE","model":"OCN_large","rank_in_archive_order":2,"of":7,"metrics":{"RACE":"71.7","RACE-h":"69.6","RACE-m":"76.7"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.03033","atlas_url":"https://app.syntology.ai/?focus=1903.03033","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":"1903.03033"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.03033\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.03033"},"call":"get_concepts_for_paper(arxiv_id=\"1903.03033\")"}],"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":"14a782067ca442a14f065b439968fece20356901922f08925c3c9aa213267803","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}