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

Authors

  • Qingbao Huang School of Software Engineering, South China University of Technology, Guangzhou, China School of Electrical Engineering, Guangxi University, Nanning, China
  • Linzhang Mo School of Electrical Engineering, Guangxi University, Nanning, China
  • Pijian Li School of Electrical Engineering, Guangxi University, Nanning, China
  • Yi Cai School of Software Engineering, South China University of Technology, Guangzhou, China Key Laboratory of Big Data and Intelligent Robot (SCUT), MOE of China
  • Qingguang Liu School of Electrical Engineering, Guangxi University, Nanning, China
  • Jielong Wei School of Electrical Engineering, Guangxi University, Nanning, China
  • Qing Li Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China
  • Ho-fung Leung Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, China

DOI:

https://doi.org/10.1609/aaai.v35i14.17545

Keywords:

Generation

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 Multi-level 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.

Downloads

Published

2021-05-18

How to Cite

Huang, Q., Mo, L., Li, P., Cai, Y., Liu, Q., Wei, J., Li, Q., & Leung, H.- fung. (2021). Story Ending Generation with Multi-Level Graph Convolutional Networks over Dependency Trees. Proceedings of the AAAI Conference on Artificial Intelligence, 35(14), 13073-13081. https://doi.org/10.1609/aaai.v35i14.17545

Issue

Section

AAAI Technical Track on Speech and Natural Language Processing I