Abstract
Recently, question answering over temporal knowledge graphs (i.e., TKGQA) has been introduced and investigated, in quest of reasoning about dynamic factual knowledge. To foster research on TKGQA, a few datasets have been curated (e.g., CRONQUESTIONS and Complex-CRONQUESTIONS), and various models have been proposed based on these datasets. Nevertheless, existing efforts overlook the fact that real-life applications of TKGQA also tend to be complex in temporal granularity, i.e., the questions may concern mixed temporal granularities (e.g., both day and month). To overcome the limitation, in this paper, we motivate the notion of multi-granularity temporal question answering over knowledge graphs and present a large-scale dataset for multi-granularity TKGQA, namely MULTITQ. To the best of our knowledge, MULTITQ is among the first of its kind, and compared with existing datasets on TKGQA, MULTITQ features at least two desirable aspects-ample relevant facts and multiple temporal granularities. It is expected to better reflect real-world challenges, and serve as a test bed for TKGQA models. In addition, we propose a competing baseline MultiQA over MULTITQ, which is experimentally demonstrated to be effective in dealing with TKGQA. The data and code are released at https://github.com/czy1999/MultiTQ.
Cite
CITATION STYLE
Chen, Z., Liao, J., & Zhao, X. (2023). Multi-granularity Temporal Question Answering over Knowledge Graphs. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1, pp. 11378–11392). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.acl-long.637
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.