English
Related papers

Related papers: DYLE: Dynamic Latent Extraction for Abstractive Lo…

200 papers

Document-Level Relation Extraction (DocRE) presents significant challenges due to its reliance on cross-sentence context and the long-tail distribution of relation types, where many relations have scarce training examples. In this work, we…

Computation and Language · Computer Science 2026-01-19 Laura Menotti , Stefano Marchesin , Gianmaria Silvello

Constructing accurate knowledge graphs from long texts and low-resource languages is challenging, as large language models (LLMs) experience degraded performance with longer input chunks. This problem is amplified in low-resource settings…

Computation and Language · Computer Science 2025-03-25 Divyansh Singh , Manuel Nunez Martinez , Bonnie J. Dorr , Sonja Schmer Galunder

We propose a new framework for abstractive text summarization based on a sequence-to-sequence oriented encoder-decoder model equipped with a deep recurrent generative decoder (DRGN). Latent structure information implied in the target…

Computation and Language · Computer Science 2017-08-03 Piji Li , Wai Lam , Lidong Bing , Zihao Wang

Text summarization aims to generate a headline or a short summary consisting of the major information of the source text. Recent studies employ the sequence-to-sequence framework to encode the input with a neural network and generate…

Computation and Language · Computer Science 2020-03-26 Haiyang Xu , Yahao He , Kun Han , Junwen Chen , Xiangang Li

Extractive models usually formulate text summarization as extracting fixed top-$k$ salient sentences from the document as a summary. Few works exploited extracting finer-grained Elementary Discourse Unit (EDU) with little analysis and…

Computation and Language · Computer Science 2023-03-14 Yuping Wu , Ching-Hsun Tseng , Jiayu Shang , Shengzhong Mao , Goran Nenadic , Xiao-Jun Zeng

The acceleration of Large Language Models (LLMs) with speculative decoding provides a significant runtime improvement without any loss of accuracy. Currently, EAGLE-2 is the state-of-the-art speculative decoding method, improving on EAGLE…

Computation and Language · Computer Science 2024-09-04 Oscar Brown , Zhengjie Wang , Andrea Do , Nikhil Mathew , Cheng Yu

Traditional approaches to extractive summarization rely heavily on human-engineered features. In this work we propose a data-driven approach based on neural networks and continuous sentence features. We develop a general framework for…

Computation and Language · Computer Science 2016-07-04 Jianpeng Cheng , Mirella Lapata

Abstractive summarization at controllable lengths is a challenging task in natural language processing. It is even more challenging for domains where limited training data is available or scenarios in which the length of the summary is not…

Computation and Language · Computer Science 2020-12-01 Ritesh Sarkhel , Moniba Keymanesh , Arnab Nandi , Srinivasan Parthasarathy

In this work, we model abstractive text summarization using Attentional Encoder-Decoder Recurrent Neural Networks, and show that they achieve state-of-the-art performance on two different corpora. We propose several novel models that…

Computation and Language · Computer Science 2016-08-29 Ramesh Nallapati , Bowen Zhou , Cicero Nogueira dos santos , Caglar Gulcehre , Bing Xiang

In this paper, we compare various methods to compress a text using a neural model. We find that extracting tokens as latent variables significantly outperforms the state-of-the-art discrete latent variable models such as VQ-VAE.…

Computation and Language · Computer Science 2019-01-28 Aran Komatsuzaki

Dialogue summarization helps readers capture salient information from long conversations in meetings, interviews, and TV series. However, real-world dialogues pose a great challenge to current summarization models, as the dialogue length…

Computation and Language · Computer Science 2021-09-13 Yusen Zhang , Ansong Ni , Tao Yu , Rui Zhang , Chenguang Zhu , Budhaditya Deb , Asli Celikyilmaz , Ahmed Hassan Awadallah , Dragomir Radev

Document Information Extraction (DIE) aims to extract structured information from Visually Rich Documents (VRDs). Previous full-training approaches have demonstrated strong performance but may struggle with generalization to unseen data. In…

Computation and Language · Computer Science 2024-12-24 Jinyu Zhang , Zhiyuan You , Jize Wang , Xinyi Le

We propose a new length-controllable abstractive summarization model. Recent state-of-the-art abstractive summarization models based on encoder-decoder models generate only one summary per source text. However, controllable summarization,…

Computation and Language · Computer Science 2020-01-22 Itsumi Saito , Kyosuke Nishida , Kosuke Nishida , Atsushi Otsuka , Hisako Asano , Junji Tomita , Hiroyuki Shindo , Yuji Matsumoto

Summarization based on text extraction is inherently limited, but generation-style abstractive methods have proven challenging to build. In this work, we propose a fully data-driven approach to abstractive sentence summarization. Our method…

Computation and Language · Computer Science 2015-09-04 Alexander M. Rush , Sumit Chopra , Jason Weston

Length-control summarization aims to condense long texts into a short one within a certain length limit. Previous approaches often use autoregressive (AR) models and treat the length requirement as a soft constraint, which may not always be…

Computation and Language · Computer Science 2025-02-10 Chenyang Huang , Hao Zhou , Cameron Jen , Kangjie Zheng , Osmar R. Zaïane , Lili Mou

Large language models with long context windows can answer complex questions directly from full-length academic, technical, and policy documents, but passing entire documents is often costly, slow, and can degrade answer quality while…

Text summarization condenses a text to a shorter version while retaining the important informations. Abstractive summarization is a recent development that generates new phrases, rather than simply copying or rephrasing sentences within the…

Computation and Language · Computer Science 2018-02-06 André Cibils , Claudiu Musat , Andreea Hossman , Michael Baeriswyl

Current abstractive summarization systems outperform their extractive counterparts, but their widespread adoption is inhibited by the inherent lack of interpretability. To achieve the best of both worlds, we propose EASE, an…

Computation and Language · Computer Science 2021-05-17 Haoran Li , Arash Einolghozati , Srinivasan Iyer , Bhargavi Paranjape , Yashar Mehdad , Sonal Gupta , Marjan Ghazvininejad

Construction of human-curated annotated datasets for abstractive text summarization (ATS) is very time-consuming and expensive because creating each instance requires a human annotator to read a long document and compose a shorter summary…

Abstractive summarization typically relies on large collections of paired articles and summaries. However, in many cases, parallel data is scarce and costly to obtain. We develop an abstractive summarization system that relies only on large…

Computation and Language · Computer Science 2020-03-04 Nikola I. Nikolov , Richard H. R. Hahnloser