Long and Diverse Text Generation with Planning-based Hierarchical Variational Model

Zhihong Shao, Minlie Huang, Jiangtao Wen, Wenfei Xu, Xiaoyan Zhu
8/19/2019
cs.CLcs.LG

Official code: ZhihongShao/Planning-based-Hierarchical-Variational-Model (121 stars, last commit 2020-04-02).

Abstract

Existing neural methods for data-to-text generation are still struggling to produce long and diverse texts: they are insufficient to model input data dynamically during generation, to capture inter-sentence coherence, or to generate diversified expressions. To address these issues, we propose a Planning-based Hierarchical Variational Model (PHVM). Our model first plans a sequence of groups (each group is a subset of input items to be covered by a sentence) and then realizes each sentence conditioned on the planning result and the previously generated context, thereby decomposing long text generation into dependent sentence generation sub-tasks. To capture expression diversity, we devise a hierarchical latent structure where a global planning latent variable models the diversity of reasonable planning and a sequence of local latent variables controls sentence realization. Experiments show that our model outperforms state-of-the-art baselines in long and diverse text generation.

View on arXivView PDF

Code Implementations(1)

Dataset and code for ``Long and Diverse Text Generation with Planning-based Hierarchical Variational Model (EMNLP 2019)``

12138Shell, PythonAug 19, 20196 years ago

Cite this paper

@article{shao2019long,
  title  = {Long and Diverse Text Generation with Planning-based Hierarchical Variational Model},
  author = {Zhihong Shao and Minlie Huang and Jiangtao Wen and Wenfei Xu and Xiaoyan Zhu},
  year   = {2019},
  eprint = {1908.06605},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1908.06605}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1908.06605.svg)](https://codeofpaper.com/paper/1908.06605)

Discussion