Multi-hop Reading Comprehension through Question Decomposition and Rescoring

Sewon Min, Victor Zhong, Luke Zettlemoyer, Hannaneh Hajishirzi
6/7/2019
cs.CLcs.AI

Official code: shmsw25/DecompRC (138 stars, last commit 2022-04-23).

Abstract

Multi-hop Reading Comprehension (RC) requires reasoning and aggregation across several paragraphs. We propose a system for multi-hop RC that decomposes a compositional question into simpler sub-questions that can be answered by off-the-shelf single-hop RC models. Since annotations for such decomposition are expensive, we recast sub-question generation as a span prediction problem and show that our method, trained using only 400 labeled examples, generates sub-questions that are as effective as human-authored sub-questions. We also introduce a new global rescoring approach that considers each decomposition (i.e. the sub-questions and their answers) to select the best final answer, greatly improving overall performance. Our experiments on HotpotQA show that this approach achieves the state-of-the-art results, while providing explainable evidence for its decision making in the form of sub-questions.

View on arXivView PDF

Code Implementations(1)

shmsw25/DecompRCOfficial100%

An original implementation of ACL 2019, "Multi-hop Reading Comprehension through Question Decomposition and Rescoring"

13833Python, MakefileJun 4, 20194 years ago

Cite this paper

@article{min2019multihop,
  title  = {Multi-hop Reading Comprehension through Question Decomposition and Rescoring},
  author = {Sewon Min and Victor Zhong and Luke Zettlemoyer and Hannaneh Hajishirzi},
  year   = {2019},
  eprint = {1906.02916},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1906.02916}
}

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

Discussion