{"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/smarnet-teaching-machines-to-read-and","title":"Smarnet: Teaching Machines to Read and Comprehend Like Human","arxiv_id":"1710.02772","date":"2017-10-08","proceeding":null,"authors":["Zheqian Chen","Rongqin Yang","Bin Cao","Zhou Zhao","Deng Cai","Xiaofei He"],"abstract":"Machine Comprehension (MC) is a challenging task in Natural Language\nProcessing field, which aims to guide the machine to comprehend a passage and\nanswer the given question. Many existing approaches on MC task are suffering\nthe inefficiency in some bottlenecks, such as insufficient lexical\nunderstanding, complex question-passage interaction, incorrect answer\nextraction and so on. In this paper, we address these problems from the\nviewpoint of how humans deal with reading tests in a scientific way.\nSpecifically, we first propose a novel lexical gating mechanism to dynamically\ncombine the words and characters representations. We then guide the machines to\nread in an interactive way with attention mechanism and memory network. Finally\nwe add a checking layer to refine the answer for insurance. The extensive\nexperiments on two popular datasets SQuAD and TriviaQA show that our method\nexceeds considerable performance than most state-of-the-art solutions at the\ntime of submission.","url_abs":"http://arxiv.org/abs/1710.02772v1","url_pdf":"http://arxiv.org/pdf/1710.02772v1.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":"question-answering","task_name":"Question Answering"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"},{"task_slug":"triviaqa","task_name":"TriviaQA"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/question-answering-on-squad11","task":"Question Answering","dataset":"SQuAD1.1","model":"smarnet (single model)","rank_in_archive_order":149,"of":213,"metrics":{"EM":"71.415","F1":"80.160"},"uses_additional_data":false},{"leaderboard":"/sota/question-answering-on-squad11-dev","task":"Question Answering","dataset":"SQuAD1.1 dev","model":"Smarnet","rank_in_archive_order":33,"of":55,"metrics":{"EM":"71.362","F1":"80.183"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"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":"cd097c3d68eaad62d3fe578ba3246dad16b4dff618e4032078409c2aff8132d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}