English
Related papers

Related papers: Document Expansion by Query Prediction

200 papers

Most of the fastest-growing string collections today are repetitive, that is, most of the constituent documents are similar to many others. As these collections keep growing, a key approach to handling them is to exploit their…

Information Retrieval · Computer Science 2017-05-22 Travis Gagie , Aleksi Hartikainen , Kalle Karhu , Juha Kärkkäinen , Gonzalo Navarro , Simon J. Puglisi , Jouni Sirén

Query expansion aims to mitigate the mismatch between the language used in a query and in a document. However, query expansion methods can suffer from introducing non-relevant information when expanding the query. To bridge this gap,…

Information Retrieval · Computer Science 2020-11-04 Zhi Zheng , Kai Hui , Ben He , Xianpei Han , Le Sun , Andrew Yates

Search engines rely heavily on term-based approaches that represent queries and documents as bags of words. Text---a document or a query---is represented by a bag of its words that ignores grammar and word order, but retains word frequency…

Information Retrieval · Computer Science 2017-11-17 Christophe Van Gysel

Document retrieval aims at finding the most important documents where a pattern appears in a collection of strings. Traditional pattern-matching techniques yield brute-force document retrieval solutions, which has motivated the research on…

Data Structures and Algorithms · Computer Science 2014-07-02 Gonzalo Navarro , Simon J. Puglisi , Jouni Sirén

Manifold ranking has been successfully applied in query-oriented multi-document summarization. It not only makes use of the relationships among the sentences, but also the relationships between the given query and the sentences. However,…

Information Retrieval · Computer Science 2021-08-30 Quanye Jia , Rui Liu , Jianying Lin

In this paper, we introduce Rank-R1, a novel LLM-based reranker that performs reasoning over both the user query and candidate documents before performing the ranking task. Existing document reranking methods based on large language models…

Information Retrieval · Computer Science 2025-03-11 Shengyao Zhuang , Xueguang Ma , Bevan Koopman , Jimmy Lin , Guido Zuccon

Reading comprehension models are based on recurrent neural networks that sequentially process the document tokens. As interest turns to answering more complex questions over longer documents, sequential reading of large portions of text…

Computation and Language · Computer Science 2018-09-11 Mor Geva , Jonathan Berant

A well-known way to improve the performance of document retrieval is to expand the user's query. Several approaches have been proposed in the literature, and some of them are considered as yielding state-of-the-art results in IR. In this…

Information Retrieval · Computer Science 2020-12-17 Vincent Claveau

State-of-the-art systems in deep question answering proceed as follows: (1) an initial document retrieval selects relevant documents, which (2) are then processed by a neural network in order to extract the final answer. Yet the exact…

Computation and Language · Computer Science 2018-08-21 Bernhard Kratzwald , Stefan Feuerriegel

Keyword based search engines have problems with term ambiguity and vocabulary mismatch. In this paper, we propose a query expansion technique that enriches queries expressed as keywords and short natural language descriptions. We present a…

Information Retrieval · Computer Science 2013-10-23 Joan Guisado-Gámez , David Dominguez-Sal , Josep-LLuis Larriba-Pey

The widely used retrieve-and-rerank pipeline faces two critical limitations: they are constrained by the initial retrieval quality of the top-k documents, and the growing computational demands of LLM-based rerankers restrict the number of…

Information Retrieval · Computer Science 2025-09-10 Haike Xu , Tong Chen

This paper introduces a simple yet effective query expansion approach, denoted as query2doc, to improve both sparse and dense retrieval systems. The proposed method first generates pseudo-documents by few-shot prompting large language…

Information Retrieval · Computer Science 2023-10-12 Liang Wang , Nan Yang , Furu Wei

Query-expansion via pseudo-relevance feedback is a popular method of overcoming the problem of vocabulary mismatch and of increasing average retrieval effectiveness. In this paper, we develop a new method that estimates a query topic model…

Information Retrieval · Computer Science 2016-02-05 Ronan Cummins

In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents for a given search query. In this paper, term distribution analysis using Fourier…

Information Retrieval · Computer Science 2009-07-18 Patricio Galeas , Ralph Kretschmer , Bernd Freisleben

Answering multiple-choice questions in a setting in which no supporting documents are explicitly provided continues to stand as a core problem in natural language processing. The contribution of this article is two-fold. First, it describes…

Computation and Language · Computer Science 2019-11-15 George-Sebastian Pîrtoacă , Traian Rebedea , Stefan Ruseti

Query expansion is a method for alleviating the vocabulary mismatch problem present in information retrieval tasks. Previous works have shown that terms selected for query expansion by traditional methods such as pseudo-relevance feedback…

Information Retrieval · Computer Science 2018-11-09 Ayyoob Imani , Amir Vakili , Ali Montazer , Azadeh Shakery

This paper presents a procedure to retrieve subsets of relevant documents from large text collections for Content Analysis, e.g. in social sciences. Document retrieval for this purpose needs to take account of the fact that analysts often…

Information Retrieval · Computer Science 2017-07-12 Gregor Wiedemann , Andreas Niekler

Question-answering (QA) is an important application of Information Retrieval (IR) and language models, and the latest trend is toward pre-trained large neural networks with embedding parameters. Augmenting QA performances with these LLMs…

Information Retrieval · Computer Science 2024-11-05 Lixiao Yang , Mengyang Xu , Weimao Ke

Pairwise re-ranking models predict which of two documents is more relevant to a query and then aggregate a final ranking from such preferences. This is often more effective than pointwise re-ranking models that directly predict a relevance…

Information Retrieval · Computer Science 2022-07-12 Lukas Gienapp , Maik Fröbe , Matthias Hagen , Martin Potthast

This paper challenges a cross-genre document retrieval task, where the queries are in formal writing and the target documents are in conversational writing. In this task, a query, is a sentence extracted from either a summary or a plot of…

Computation and Language · Computer Science 2017-07-17 Tomasz Jurczyk , Jinho D. Choi