pith. sign in

arxiv: 1708.00625 · v1 · pith:SLFHYTIYnew · submitted 2017-08-02 · 💻 cs.CL · cs.AI

Deep Recurrent Generative Decoder for Abstractive Text Summarization

classification 💻 cs.CL cs.AI
keywords latentrecurrentabstractivegenerativesummarizationdecoderdeepdrgn
0
0 comments X
read the original abstract

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 summaries is learned based on a recurrent latent random model for improving the summarization quality. Neural variational inference is employed to address the intractable posterior inference for the recurrent latent variables. Abstractive summaries are generated based on both the generative latent variables and the discriminative deterministic states. Extensive experiments on some benchmark datasets in different languages show that DRGN achieves improvements over the state-of-the-art methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Decomposable Neural Paraphrase Generation

    cs.CL 2019-06 unverdicted novelty 6.0

    DNPG is a multi-component Transformer model that disentangles paraphrase generation across granularity levels and supports unsupervised domain adaptation, claiming competitive in-domain and superior cross-domain performance.