Saxena, Apoorv ; Chakrabarti, Soumen ; Talukdar, Partha (2021) Question Answering Over Temporal Knowledge Graphs In: 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing.
PDF
499kB |
Official URL: http://doi.org/10.18653/v1/2021.acl-long.520
Related URL: http://dx.doi.org/10.18653/v1/2021.acl-long.520
Abstract
Temporal Knowledge Graphs (Temporal KGs) extend regular Knowledge Graphs by providing temporal scopes (start and end times) on each edge in the KG. While Question Answering over KG (KGQA) has received some attention from the research community, QA over Temporal KGs (Temporal KGQA) is a relatively unexplored area. Lack of broad coverage datasets has been another factor limiting progress in this area. We address this challenge by presenting CRONQUESTIONS, the largest known Temporal KGQA dataset, clearly stratified into buckets of structural complexity. CRONQUESTIONS expands the only known previous dataset by a factor of 340x. We find that various state-of-the-art KGQA methods fall far short of the desired performance on this new dataset. In response, we also propose CRONKGQA, a transformer-based solution that exploits recent advances in Temporal KG embeddings, and achieves performance superior to all baselines, with an increase of 120% in accuracy over the next best performing method. Through extensive experiments, we give detailed insights into the workings of CRONKGQA, as well as situations where significant further improvements appear possible. In addition to the dataset, we have released our code as well.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Source: | Copyright of this article belongs to Association for Computational Linguistics |
ID Code: | 130861 |
Deposited On: | 01 Dec 2022 04:30 |
Last Modified: | 27 Jan 2023 09:29 |
Repository Staff Only: item control page