GraphPlan: Story Generation by Planning with Event Graph

• URL: http://arxiv.org/abs/2102.02977v1
• Date: Fri, 5 Feb 2021 03:18:55 GMT
• Title: GraphPlan: Story Generation by Planning with Event Graph
• Authors: Hong Chen, Raphael Shu, Hiroya Takamura, Hideki Nakayama
• Abstract summary: We focus on planning a sequence of events assisted by event graphs, and use the events to guide the generator. Instead of using a sequence-to-sequence model to output a storyline, we propose to generate an event sequence by walking on an event graph.
• Score: 31.29515089313627
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Story generation is a task that aims to automatically produce multiple sentences to make up a meaningful story. This task is challenging because it requires high-level understanding of semantic meaning of sentences and causality of story events. Naive sequence-to-sequence models generally fail to acquire such knowledge, as the logical correctness can hardly be guaranteed in a text generation model without the strategic planning. In this paper, we focus on planning a sequence of events assisted by event graphs, and use the events to guide the generator. Instead of using a sequence-to-sequence model to output a storyline as in some existing works, we propose to generate an event sequence by walking on an event graph. The event graphs are built automatically based on the corpus. To evaluate the proposed approach, we conduct human evaluation both on event planning and story generation. Based on large-scale human annotation results, our proposed approach is shown to produce more logically correct event sequences and stories.

Related papers

• Prompt-based Graph Model for Joint Liberal Event Extraction and Event Schema Induction [1.3154296174423619]
  Events are essential components of speech and texts, describing the changes in the state of entities. The event extraction task aims to identify and classify events and find their participants according to event schemas. The researchers propose Liberal Event Extraction (LEE), which aims to extract events and discover event schemas simultaneously.
  arXiv  Detail & Related papers  (2024-03-19T07:56:42Z)
• Distilling Event Sequence Knowledge From Large Language Models [17.105913216452738]
  Event sequence models have been found to be highly effective in the analysis and prediction of events. We use Large Language Models to generate event sequences that can effectively be used for probabilistic event model construction. We show that our approach can generate high-quality event sequences, filling a knowledge gap in the input KG.
  arXiv  Detail & Related papers  (2024-01-14T09:34:42Z)
• Neural Story Planning [8.600049807193413]
  We present an approach to story plot generation that unifies causal planning with neural language models. Our system infers the preconditions for events in the story and then events that will cause those conditions to become true. Results indicate that our proposed method produces more coherent plotlines than several strong baselines.
  arXiv  Detail & Related papers  (2022-12-16T21:29:41Z)
• A Graph Regularized Point Process Model For Event Propagation Sequence [2.9093633827040724]
  Point process is the dominant paradigm for modeling event sequences occurring at irregular intervals. We propose a Graph Regularized Point Process that characterizes the event interactions across nodes with neighbors. By applying a graph regularization method, GRPP provides model interpretability by uncovering influence strengths between nodes.
  arXiv  Detail & Related papers  (2022-11-21T04:49:59Z)
• NGEP: A Graph-based Event Planning Framework for Story Generation [17.049035309926637]
  We propose NGEP, a novel event planning framework which generates an event sequence by performing inference on an automatically constructed event graph. We conduct a range of experiments on multiple criteria, and the results demonstrate that our graph-based neural framework outperforms the state-of-the-art (SOTA) event planning approaches.
  arXiv  Detail & Related papers  (2022-10-19T14:49:27Z)
• Sequential Manipulation Planning on Scene Graph [90.28117916077073]
  We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with an optimization method. A task plan is then succinct by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations corresponding to possible robot actions.
  arXiv  Detail & Related papers  (2022-07-10T02:01:33Z)
• Schema-Guided Event Graph Completion [103.32326979796596]
  We tackle a new task, event graph completion, which aims to predict missing event nodes for event graphs. Existing prediction or graph completion methods have difficulty dealing with event graphs because they are usually designed for a single large graph.
  arXiv  Detail & Related papers  (2022-06-06T21:51:10Z)
• Event Transition Planning for Open-ended Text Generation [55.729259805477376]
  Open-ended text generation tasks require models to generate a coherent continuation given limited preceding context. We propose a novel two-stage method which explicitly arranges the ensuing events in open-ended text generation. Our approach can be understood as a specially-trained coarse-to-fine algorithm.
  arXiv  Detail & Related papers  (2022-04-20T13:37:51Z)
• Future is not One-dimensional: Graph Modeling based Complex Event Schema Induction for Event Prediction [90.75260063651763]
  We introduce the concept of Temporal Complex Event: a graph-based schema representation that encompasses events, arguments, temporal connections and argument relations. We release a new schema learning corpus containing 6,399 documents accompanied with event graphs, and manually constructed gold schemas.
  arXiv  Detail & Related papers  (2021-04-13T16:41:05Z)
• Team RUC_AIM3 Technical Report at Activitynet 2020 Task 2: Exploring Sequential Events Detection for Dense Video Captioning [63.91369308085091]
  We propose a novel and simple model for event sequence generation and explore temporal relationships of the event sequence in the video. The proposed model omits inefficient two-stage proposal generation and directly generates event boundaries conditioned on bi-directional temporal dependency in one pass. The overall system achieves state-of-the-art performance on the dense-captioning events in video task with 9.894 METEOR score on the challenge testing set.
  arXiv  Detail & Related papers  (2020-06-14T13:21:37Z)
• PlotMachines: Outline-Conditioned Generation with Dynamic Plot State Tracking [128.76063992147016]
  We present PlotMachines, a neural narrative model that learns to transform an outline into a coherent story by tracking the dynamic plot states. In addition, we enrich PlotMachines with high-level discourse structure so that the model can learn different writing styles corresponding to different parts of the narrative.
  arXiv  Detail & Related papers  (2020-04-30T17:16:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.