Abstract
Answering factual questions with temporal intent over knowledge graphs (temporal KGQA) attracts rising attention in recent years. In the generation of temporal queries, existing KGQA methods ignore the fact that some intrinsic connections between events can make them temporally related, which may limit their capability. We systematically analyze the possible interpretation of temporal constraints and conclude the interpretation structures as the Semantic Framework of Temporal Constraints, SF-TCons. Based on the semantic framework, we propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities, where the exploring process is restricted by SF-TCons. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.- Anthology ID:
- 2022.emnlp-main.122
- Volume:
- Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing
- Month:
- December
- Year:
- 2022
- Address:
- Abu Dhabi, United Arab Emirates
- Editors:
- Yoav Goldberg, Zornitsa Kozareva, Yue Zhang
- Venue:
- EMNLP
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 1867–1877
- Language:
- URL:
- https://aclanthology.org/2022.emnlp-main.122
- DOI:
- 10.18653/v1/2022.emnlp-main.122
- Cite (ACL):
- Wentao Ding, Hao Chen, Huayu Li, and Yuzhong Qu. 2022. Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 1867–1877, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics.
- Cite (Informal):
- Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs (Ding et al., EMNLP 2022)
- PDF:
- https://preview.aclanthology.org/ingest-acl-2023-videos/2022.emnlp-main.122.pdf