RankQA: Neural Question Answering with Answer Re-Ranking
The conventional paradigm in neural question answering (QA) for narrative content is limited to a two-stage process: first, relevant text passages are retrieved and, subsequently, a neural network for machine comprehension extracts the likeliest answer. However, both stages are largely isolated in the status quo and, hence, information from the two phases is never properly fused. In contrast, this work proposes RankQA: RankQA extends the conventional two-stage process in neural QA with a third stage that performs an additional answer re-ranking. The re-ranking leverages different features that are directly extracted from the QA pipeline, i.e., a combination of retrieval and comprehension features. While our intentionally simple design allows for an efficient, data-sparse estimation, it nevertheless outperforms more complex QA systems by a significant margin: in fact, RankQA achieves state-of-the-art performance on 3 out of 4 benchmark datasets. Furthermore, its performance is especially superior in settings where the size of the corpus is dynamic. Here the answer re-ranking provides an effective remedy against the underlying noise-information trade-off due to a variable corpus size. As a consequence, RankQA represents a novel, powerful, and thus challenging baseline for future research in content-based QA.
Code (1)
Tasks
Question AnsweringReading ComprehensionRe-RankingRetrievalSimilar Papers 제목 키워드 기반
Enhancing Q&A Text Retrieval with Ranking Models: Benchmarking, fine-tuning and deploying Rerankers for RAG
Ranking models play a crucial role in enhancing overall accuracy of text retrieval systems. These multi-stage systems typically utilize either dense embedding models or sparse lexical indices to retrieve relevant passage…
BenchmarkingQuestion AnsweringRAGRetrieval+2Passage-specific Prompt Tuning for Passage Reranking in Question Answering with Large Language Models
Effective passage retrieval and reranking methods have been widely utilized to identify suitable candidates in open-domain question answering tasks, recent studies have resorted to LLMs for reranking the retrieved passag…
Open-Domain Question AnsweringPassage RerankingPassage RetrievalQuestion Answering+1A Method of Query Graph Reranking for Knowledge Base Question Answering
This paper presents a novel reranking method to better choose the optimal query graph, a sub-graph of knowledge graph, to retrieve the answer for an input question in Knowledge Base Question Answering (KBQA). Existing me…
Graph RankingKnowledge Base Question AnsweringQuestion AnsweringRerankingAnswer Ranking for Product-Related Questions via Multiple Semantic Relations Modeling
Many E-commerce sites now offer product-specific question answering platforms for users to communicate with each other by posting and answering questions during online shopping. However, the multiple answers provided by …
Natural Language InferenceQuestion AnsweringKnowledge-Aided Open-Domain Question Answering
Open-domain question answering (QA) aims to find the answer to a question from a large collection of documents.Though many models for single-document machine comprehension have achieved strong performance, there is still…
Open-Domain Question AnsweringQuestion AnsweringReading ComprehensionReranking+1