Story Ending Generation with Multi-Level Graph Convolutional Networks over Dependency Trees

18Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

As an interesting and challenging task, story ending generation aims at generating a reasonable and coherent ending for a given story context. The key challenge of the task is to comprehend the context sufficiently and capture the hidden logic information effectively, which has not been well explored by most existing generative models. To tackle this issue, we propose a context-aware Multi-level Graph Convolutional Networks over Dependency Parse (MGCN-DP) trees to capture dependency relations and context clues more effectively. We utilize dependency parse trees to facilitate capturing relations and events in the context implicitly, and Multilevel Graph Convolutional Networks to update and deliver the representation crossing levels to obtain richer contextual information. Both automatic and manual evaluations show that our MGCN-DP can achieve comparable performance with state-of-the-art models. Our source code is available at https://github.com/VISLANG-Lab/MLGCN-DP.

Cite

CITATION STYLE

APA

Huang, Q., Mo, L., Li, P., Cai, Y., Liu, Q., Wei, J., … Leung, H. F. (2021). Story Ending Generation with Multi-Level Graph Convolutional Networks over Dependency Trees. In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 14B, pp. 13073–13081). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v35i14.17545

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