GGP: A Graph-based Grouping Planner for Explicit Control of Long Text Generation

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Existing data-driven methods can well handle short text generation. However, when applied to the long-text generation scenarios such as story generation or advertising text generation in the commercial scenario, these methods may generate illogical and uncontrollable texts. To address these aforementioned issues, we propose a graph-based grouping planner∼(GGP) following the idea of first-plan-then-generate. Specifically, given a collection of key phrases, GGP firstly encodes these phrases into a instance-level sequential representation and a corpus-level graph-based representation separately. With these two synergic representations, we then regroup these phrases into a fine-grained plan, based on which we generate the final long text. We conduct our experiments on three long text generation datasets and the experimental results reveal that GGP significantly outperforms baselines, which proves that GGP can control the long text generation with knowing how to say and in what order.

Cite

CITATION STYLE

APA

Lin, X., Cui, S., Zhao, Z., Zhou, W., Zhang, J., & Chen, H. (2021). GGP: A Graph-based Grouping Planner for Explicit Control of Long Text Generation. In International Conference on Information and Knowledge Management, Proceedings (pp. 3253–3257). Association for Computing Machinery. https://doi.org/10.1145/3459637.3482111

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free