Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
7-2020
Abstract
Previous work on answering complex questions from knowledge bases usually separately addresses two types of complexity: questions with constraints and questions with multiple hops of relations. In this paper, we handle both types of complexity at the same time. Motivated by the observation that early incorporation of constraints into query graphs can more effectively prune the search space, we propose a modified staged query graph generation method with more flexible ways to generate query graphs. Our experiments clearly show that our method achieves the state of the art on three benchmark KBQA datasets.
Discipline
Artificial Intelligence and Robotics | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
First Page
969
Last Page
974
Identifier
10.18653/v1/2020.acl-main.91
Publisher
Association for Computational Linguistics
City or Country
Online
Citation
LAN, Yunshi and Jing JIANG.
Query graph generation for answering multi-hop complex questions from knowledge bases. (2020). Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 969-974.
Available at: https://ink.library.smu.edu.sg/sis_research/5271
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.18653/v1/2020.acl-main.91