# Answering Complicated Question Intents Expressed in Decomposed Question Sequences

Source: [Answering Complicated Question Intents Expressed in Decomposed Question Sequences](<https://www.sota2.com/research/paper/68fa62d91e209131ce9fba49>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:28:18.594Z

Authors: Mohit Iyyer, Wen-tau Yih, Ming-Wei Chang

Published: 2016-11-04T01:54:03.000Z

## Abstract

Recent work in semantic parsing for question answering has focused on long and complicated questions, many of which would seem unnatural if asked in a normal conversation between two humans. In an effort to explore a conversational QA setting, we present a more realistic task: answering sequences of simple but inter-related questions. We collect a dataset of 6,066 question sequences that inquire about semi-structured tables from Wikipedia, with 17,553 question-answer pairs in total. Existing QA systems face two major problems when evaluated on our dataset: (1) handling questions that contain coreferences to previous questions or answers, and (2) matching words or phrases in a question to corresponding entries in the associated table. We conclude by proposing strategies to handle both of these issues.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1611.01242>)

[PDF](<https://arxiv.org/pdf/1611.01242.pdf>)
