The Web as a Knowledge-Base for Answering Complex Questions

@article{Talmor2018TheWA,
  title={The Web as a Knowledge-Base for Answering Complex Questions},
  author={Alon Talmor and Jonathan Berant},
  journal={ArXiv},
  year={2018},
  volume={abs/1803.06643},
  url={https://api.semanticscholar.org/CorpusID:3986974}
}
This paper proposes to decompose complex questions into a sequence of simple questions, and compute the final answer from the sequence of answers, and empirically demonstrates that question decomposition improves performance from 20.8 precision@1 to 27.5 precision @1 on this new dataset.
[PDF] Semantic Reader
701 Citations
Highly Influential Citations
136
Background Citations
237
Methods Citations
174
Results Citations
5

Figures and Tables from this paper

701 Citations

Learning to Answer Complex Questions over Knowledge Bases with Query Composition

A KB-QA system, TextRay, is proposed, which answers complex questions using a novel decompose-execute-join approach and uses a semantic matching model which is able to learn simple queries using implicit supervision from question-answer pairs, thus eliminating the need for complex query patterns.

Question answering over knowledge bases with continuous learning

This dissertation introduces NEQA, a framework for continuous learning for QA over KBs, and presents QUINT, an approach for answering natural language questions over knowledge bases using automatically learned templates.

Complex Knowledge Base Question Answering: A Survey

A review of recent advances in KBQA with the focus on solving complex questions, which usually contain multiple subjects, express compound relations, or involve numerical operations, and two mainstream categories of methods, namely semantic parsing- based (SP-based) methods and information retrieval-based (IR) methods.

Answering Open-Domain Questions of Varying Reasoning Steps from Text

A unified system to answer directly from text open-domain questions that may require a varying number of retrieval steps, using a single multi-task transformer model to perform all the necessary subtasks in an iterative fashion.

Chain-of-Question: A Progressive Question Decomposition Approach for Complex Knowledge Base Question Answering

Chain-of-Question, a progressive question decomposition approach to address complex KBQA challenges, inspired by chain-of-thought is proposed, which design a prompt to guide LLM to sequentially decompose multiple semantically clear sub-questions and provide corresponding reference answers, where each step of the decomposition relies on the previous results.

A Benchmark for Generalizable and Interpretable Temporal Question Answering over Knowledge Bases

This paper presents a benchmark dataset for temporal reasoning, TempQA-WD, based on Wikidata, which is the most frequently curated, openly available knowledge base and generalizes to multiple knowledge bases: Freebase andWikidata.

A Survey on Complex Question Answering over Knowledge Base: Recent Advances and Challenges

The recent advances in complex QA are introduced, the methods of these branches are described, directions for future research are analyzed and the models proposed by the Alime team are introduced.

A study of approaches to answering complex questions over knowledge bases

The authors show that the C-KBQA system aims to solve two question types: multi-hop and constraint questions, and it was possible to identify three main steps to construct a C- KBZA system and the use of two main approaches.

A Survey on Complex Knowledge Base Question Answering: Methods, Challenges and Solutions

This paper elaborately summarize the typical challenges and solutions for complex KBQA, and presents the two mainstream categories of methods, namely semantic parsing-based (SP-based) methods and information retrieval-based [IR-based] methods.

ConditionalQA: A Complex Reading Comprehension Dataset with Conditional Answers

It is shown that ConditionalQA is challenging for many of the existing QA models, especially in selecting answer conditions, and will motivate further research in answering complex questions over long documents.
...

49 References

Evaluating Semantic Parsing against a Simple Web-based Question Answering Model

This paper proposes to evaluate semantic parsing-based question answering models by comparing them to a question answering baseline that queries the web and extracts the answer only from web snippets, without access to the target knowledge-base, and finds that this approach achieves reasonable performance.

Answering Complicated Question Intents Expressed in Decomposed Question Sequences

This work collects a dataset of 6,066 question sequences that inquire about semi-structured tables from Wikipedia, with 17,553 question-answer pairs in total, and proposes strategies to handle questions that contain coreferences to previous questions or answers.

Question Answering from Unstructured Text by Retrieval and Comprehension

This work presents a two-step approach to question answering from unstructured text, consisting of a retrieval step and a comprehension step, featuring an RNN based attention model with a novel mixture mechanism for selecting answers from either retrieved articles or a fixed vocabulary.

Semantic Parsing on Freebase from Question-Answer Pairs

This paper trains a semantic parser that scales up to Freebase and outperforms their state-of-the-art parser on the dataset of Cai and Yates (2013), despite not having annotated logical forms.

Compositional Semantic Parsing on Semi-Structured Tables

This paper proposes a logical-form driven parsing algorithm guided by strong typing constraints and shows that it obtains significant improvements over natural baselines and is made publicly available.

Constraint-Based Question Answering with Knowledge Graph

A novel systematic KBQA approach to solve multi-constraint questions is proposed, which not only obtains comparable results on the two existing benchmark data-sets, but also achieves significant improvements on the ComplexQuestions.

SQuAD: 100,000+ Questions for Machine Comprehension of Text

A strong logistic regression model is built, which achieves an F1 score of 51.0%, a significant improvement over a simple baseline (20%).

Ask the Right Questions: Active Question Reformulation with Reinforcement Learning

This work proposes an agent that sits between the user and a black box QA system and learns to reformulate questions to elicit the best possible answers, and finds that successful question reformulations look quite different from natural language paraphrases.

TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension

It is shown that, in comparison to other recently introduced large-scale datasets, TriviaQA has relatively complex, compositional questions, has considerable syntactic and lexical variability between questions and corresponding answer-evidence sentences, and requires more cross sentence reasoning to find answers.

The Value of Semantic Parse Labeling for Knowledge Base Question Answering

The value of collecting semantic parse labels for knowledge base question answering is demonstrated and the largest semantic-parse labeled dataset to date is created and shared in order to advance research in question answering.