ComplexTempQA:A 100m Dataset for Complex Temporal Question Answering

Raphael Gruber, Abdelrahman Abdallah, Michael Färber, Adam Jatowt
6/7/2024
cs.CL

Official code: DataScienceUIBK/ComplexTempQA (13 stars, CC0-1.0, last commit 2025-11-11).

Abstract

We introduce \textsc{ComplexTempQA},\footnote{Dataset and code available at: https://github.com/DataScienceUIBK/ComplexTempQA} a large-scale dataset consisting of over 100 million question-answer pairs designed to tackle the challenges in temporal question answering. \textsc{ComplexTempQA} significantly surpasses existing benchmarks in scale and scope. Utilizing Wikipedia and Wikidata, the dataset covers questions spanning over two decades and offers an unmatched scale. We introduce a new taxonomy that categorizes questions as \textit{attributes}, \textit{comparisons}, and \textit{counting} questions, revolving around events, entities, and time periods, respectively. A standout feature of \textsc{ComplexTempQA} is the high complexity of its questions, which demand reasoning capabilities for answering such as across-time comparison, temporal aggregation, and multi-hop reasoning involving temporal event ordering and entity recognition. Additionally, each question is accompanied by detailed metadata, including specific time scopes, allowing for comprehensive evaluation of temporal reasoning abilities of large language models.

View on arXivView PDF

Code Implementations(1)

CC0-1.0
132PythonFeb 8, 202411 months agoCC0-1.0

Cite this paper

@article{gruber2024complextempqaa,
  title  = {ComplexTempQA:A 100m Dataset for Complex Temporal Question Answering},
  author = {Raphael Gruber and Abdelrahman Abdallah and Michael Färber and Adam Jatowt},
  year   = {2024},
  eprint = {2406.04866},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.04866v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.04866.svg)](https://codeofpaper.com/paper/2406.04866)

Discussion