MEQA: A Benchmark for Multi-hop Event-centric Question Answering with Explanations

Ruosen Li, Zimu Wang, Son Quoc Tran, Lei Xia, Xinya Du
2/3/2026

No official code found. Best implementation: du-nlp-lab/MEQA (14 stars, MIT, last commit 2025-04-19).

Abstract

Existing benchmarks for multi-hop question answering (QA) primarily evaluate models based on their ability to reason about entities and the relationships between them. However, there’s a lack of insight into how these models perform in terms of both events and entities . In this paper, we introduce a novel semi-automatic question generation strategy by composing event structures from information extraction (IE) datasets and present the first Multi-hop Event-centric Question Answering (MEQA) benchmark 1 . It contains (1) 2,243 challenging questions that require a diverse range of complex reasoning over entity-entity, entity-event, and event-event relations; (2) corresponding multi-step QA-format event reasoning chain (explanation) which leads to the answer for each question. We also introduce two metrics for evaluating explanations: completeness and logical consistency. We conduct comprehensive benchmarking and analysis, which shows that MEQA is challenging for the latest state-of-the-art models encompassing large language models (LLMs); and how they fall short of providing faithful explanations of the event-centric reasoning process.

DOISemantic Scholar

Code Implementations(1)

du-nlp-lab/MEQACommunity73%
MIT

MEQA: A Benchmark for Multi-hop Event-centric Question Answering with Explanations

140Shell, PythonJun 6, 20241 years agoMIT

Similar Papers

Cite this paper

@article{li2026meqa,
  title  = {MEQA: A Benchmark for Multi-hop Event-centric Question Answering with Explanations},
  author = {Ruosen Li and Zimu Wang and Son Quoc Tran and Lei Xia and Xinya Du},
  year   = {2026},
  doi    = {10.52202/079017-4028},
  url    = {https://doi.org/10.52202/079017-4028},
  journal = {NEURIPS 2024 2024}
}

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/4a82e64d231c1f83f93033aa4cd509f1ed7e2e02.svg)](https://codeofpaper.com/paper/4a82e64d231c1f83f93033aa4cd509f1ed7e2e02)

Discussion