The Web as a Knowledge-Base for Answering Complex Questions (N18-1)

Copied to clipboard

Challenge: Recent work on reading comprehension made headway in answering simple questions, but tackling complex questions is still an ongoing research challenge.
Approach: They propose to decompose complex questions into a sequence of simple questions and compute the final answer from the sequence of answers.
Outcome: The proposed framework improves performance from 20.8 precision@1 to 27.5 precision@1.

Similar Papers

Complex Question Decomposition for Semantic Parsing (P19-1)

Copied to clipboard

Challenge: Existing methods that ignore the decompositionality of complex questions are not suitable for complex question semantic parsing.
Approach: They propose a hierarchical semantic parsing method which utilizes the decompositionality of complex questions for semantic paring.
Outcome: The proposed method improves on a large scale complex question semantic parsing dataset.
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)

Copied to clipboard

Challenge: Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base .
Approach: They propose to encode query structure into a uniform vector representation of a question and its semantic components into .
Outcome: The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions.
Chain-of-Question: A Progressive Question Decomposition Approach for Complex Knowledge Base Question Answering (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods to answer complex questions rely on decomposition of complex questions into sub-questions . Existing approaches to decompose complex questions are limited by the original question .
Approach: They propose a question decomposition approach to decompose semantically clear questions . they use the decomposed sub-questions to select relevant patterns as auxiliary information .
Outcome: The proposed method achieves state-of-the-art performance on multiple datasets.
A State-transition Framework to Answer Complex Questions over Knowledge Base (D18-1)

Copied to clipboard

Challenge: Existing methods for complex question answering have some limitations . existing methods employ predefined patterns or templates to understand complex questions.
Approach: They propose a state transition-based approach to translate a natural language question to a semantic query graph.
Outcome: The proposed approach outperforms state-of-the-art methods on several benchmarks with two knowledge bases.
HPE: Answering Complex Questions over Text by Hybrid Question Parsing and Execution (2023.findings-emnlp)

Copied to clipboard

Challenge: End-to-end neural networks excel at answering natural language questions but fail on complex ones . a proposed framework for question parsing and execution on textual QA is designed to combine the strengths of neural and symbolic methods.
Approach: They propose a framework for question parsing and execution on textual QA . they parse questions into an intermediate representation and use deterministic rules to translate them .
Outcome: The proposed framework outperforms existing methods in supervised, few-shot, and zero-shot settings while preserving its underlying reasoning process.
Improving Query Graph Generation for Complex Question Answering over Knowledge Base (2021.emnlp-main)

Copied to clipboard

Challenge: Existing Knowledge-based Question Answering methods use a query graph to find the answer to a question.
Approach: They propose a method that starts with the entire knowledge base and gradually shrinks it to the desired query graph.
Outcome: Experimental results show that the proposed method achieves state-of-the-art performance on ComplexWebQuestion dataset.
An empirical analysis of existing systems and datasets toward general simple question answering (2020.coling-main)

Copied to clipboard

Challenge: evaluators of simple factoid question answering using different datasets are not able to solve SimpleQuestions.
Approach: They evaluate the progress of the field toward solving simple factoid questions over a knowledge base.
Outcome: The proposed model is nearly solved on the most popular dataset, but not on the robustness of existing systems.
WebSRC: A Dataset for Web-Based Structural Reading Comprehension (2021.emnlp-main)

Copied to clipboard

Challenge: Using a web page and a question, a machine can't understand the contents of web pages.
Approach: They propose a novel dataset for web-based structural reading comprehension that consists of 400K question-answer pairs and a dataset of 6.4K web pages.
Outcome: The proposed dataset consists of 400K question-answer pairs, collected from 6.4K web pages with corresponding HTML source code, screenshots, and metadata.
Concise Answers to Complex Questions: Summarization of Long-form Answers (2023.acl-long)

Copied to clipboard

Challenge: Long-form question answering systems provide rich information by presenting paragraph-level answers, but not all information is required to answer the question.
Approach: They propose an extract-and-decontextualize approach to summarize long-form answers using state-of-the-art models.
Outcome: The proposed extract-and-decontextualize approach improves the quality of the extractive summary, exemplifying its potential in the summarization task.
A Two-Stage Approach towards Generalization in Knowledge Base Question Answering (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches for Knowledge Base Question Answering focus on a specific knowledge base or evaluating it on underlying knowledge base requires non-trivial changes.
Approach: They propose a framework that separates semantic parsing from knowledge base interaction . they propose KBQA framework that allows generalization across knowledge bases .
Outcome: The proposed framework achieves comparable or state-of-the-art performance on datasets with a different knowledge base.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations