{"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/abstractive-summarization-using-attentive","title":"Abstractive Summarization Using Attentive Neural Techniques","arxiv_id":"1810.08838","date":"2018-10-20","proceeding":null,"authors":["Jacob Krantz","Jugal Kalita"],"abstract":"In a world of proliferating data, the ability to rapidly summarize text is\ngrowing in importance. Automatic summarization of text can be thought of as a\nsequence to sequence problem. Another area of natural language processing that\nsolves a sequence to sequence problem is machine translation, which is rapidly\nevolving due to the development of attention-based encoder-decoder networks.\nThis work applies these modern techniques to abstractive summarization. We\nperform analysis on various attention mechanisms for summarization with the\ngoal of developing an approach and architecture aimed at improving the state of\nthe art. In particular, we modify and optimize a translation model with\nself-attention for generating abstractive sentence summaries. The effectiveness\nof this base model along with attention variants is compared and analyzed in\nthe context of standardized evaluation sets and test metrics. However, we show\nthat these metrics are limited in their ability to effectively score\nabstractive summaries, and propose a new approach based on the intuition that\nan abstractive model requires an abstractive evaluation.","url_abs":"http://arxiv.org/abs/1810.08838v1","url_pdf":"http://arxiv.org/pdf/1810.08838v1.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":"abstractive-summarization-using-attentive","repo_url":"https://github.com/jacobkrantz/VertMetric","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"abstractive-summarization-using-attentive","repo_url":"https://github.com/jacobkrantz/NeuralSum","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":[{"repo":"jacobkrantz/VertMetric","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jacobkrantz/NeuralSum","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"03aa30921ee0c828a4c7c622d8d5e633ba7ac2e35441cd01c1d6ea95133f9389","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}