{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/summarize-then-answer-generating-concise","title":"Summarize-then-Answer: Generating Concise Explanations for Multi-hop Reading Comprehension","arxiv_id":"2109.06853","date":"2021-09-14","proceeding":"EMNLP 2021 11","authors":["Naoya Inoue","Harsh Trivedi","Steven Sinha","Niranjan Balasubramanian","Kentaro Inui"],"abstract":"How can we generate concise explanations for multi-hop Reading Comprehension (RC)? The current strategies of identifying supporting sentences can be seen as an extractive question-focused summarization of the input text. However, these extractive explanations are not necessarily concise i.e. not minimally sufficient for answering a question. Instead, we advocate for an abstractive approach, where we propose to generate a question-focused, abstractive summary of input paragraphs and then feed it to an RC system. Given a limited amount of human-annotated abstractive explanations, we train the abstractive explainer in a semi-supervised manner, where we start from the supervised model and then train it further through trial and error maximizing a conciseness-promoted reward function. Our experiments demonstrate that the proposed abstractive explainer can generate more compact explanations than an extractive explainer with limited supervision (only 2k instances) while maintaining sufficiency.","url_abs":"https://arxiv.org/abs/2109.06853v1","url_pdf":"https://arxiv.org/pdf/2109.06853v1.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":[{"paper_slug":"summarize-then-answer-generating-concise","repo_url":"https://github.com/stonybrooknlp/suqa","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"2k","task_name":"2k"},{"task_slug":"multi-hop-reading-comprehension","task_name":"Multi-Hop Reading Comprehension"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2109.06853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06853"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/StonyBrookNLP/suqa","reach":null}],"summary":{"ran_draft_wrong":1,"unverified":3},"by_repo_kind":{"official":{"samples":4,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"e5fc82c4d78eaa5e","entry":"get_gen_scores","repo":"StonyBrookNLP/suqa","repo_kind":"official","path":"suqa.py","file_url":"https://github.com/StonyBrookNLP/suqa/blob/HEAD/suqa.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e5fc82c4d78eaa5e"}},{"code_sha256_prefix":"300336f8ee5c241d","entry":"QAModel","repo":"StonyBrookNLP/suqa","repo_kind":"official","path":"suqa.py","file_url":"https://github.com/StonyBrookNLP/suqa/blob/HEAD/suqa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"300336f8ee5c241d"}},{"code_sha256_prefix":"dda9487c9bc92b80","entry":"SuQA","repo":"StonyBrookNLP/suqa","repo_kind":"official","path":"suqa.py","file_url":"https://github.com/StonyBrookNLP/suqa/blob/HEAD/suqa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"dda9487c9bc92b80"}},{"code_sha256_prefix":"259a6d96279abd2e","entry":"XQA","repo":"StonyBrookNLP/suqa","repo_kind":"official","path":"suqa.py","file_url":"https://github.com/StonyBrookNLP/suqa/blob/HEAD/suqa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"259a6d96279abd2e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}