Javascript must be enabled to continue!
A Survey of Query Auto Completion in Information Retrieval
View through CrossRef
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al., 2013, Cai et al., 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the following functionality: given a prefix consisting of a number of characters entered into a search box, the user interface proposes alternative ways of extending the prefix to a full query. Ranking query completions is a challenging task due to the limited length of prefixes entered by users, the large volume of possible query completions matching a prefix, and the broad range of possible search intents. In recent years, a large number of query auto completion approaches have been proposed that produce ranked lists of alternative query completions by mining query logs.
In this survey, we review work on query auto completion that has been published before 2016. We focus mainly on web search and provide a formal definition of the query auto completion problem. We describe two dominant families of approaches to the query auto completion problem, one based on heuristic models and the other based on learning to rank. We also identify dominant trends in published work on query auto completion, viz. the use of time-sensitive signals and the use of user-specific signals. We describe the datasets and metrics that are used to evaluate algorithms for query auto completion. We also devote a chapter to efficiency and a chapter to presentation and interaction aspects of query auto completion. We end by discussing related tasks as well as potential research directions to further the area.
Title: A Survey of Query Auto Completion in Information Retrieval
Description:
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al.
, 2013, Cai et al.
, 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the following functionality: given a prefix consisting of a number of characters entered into a search box, the user interface proposes alternative ways of extending the prefix to a full query.
Ranking query completions is a challenging task due to the limited length of prefixes entered by users, the large volume of possible query completions matching a prefix, and the broad range of possible search intents.
In recent years, a large number of query auto completion approaches have been proposed that produce ranked lists of alternative query completions by mining query logs.
In this survey, we review work on query auto completion that has been published before 2016.
We focus mainly on web search and provide a formal definition of the query auto completion problem.
We describe two dominant families of approaches to the query auto completion problem, one based on heuristic models and the other based on learning to rank.
We also identify dominant trends in published work on query auto completion, viz.
the use of time-sensitive signals and the use of user-specific signals.
We describe the datasets and metrics that are used to evaluate algorithms for query auto completion.
We also devote a chapter to efficiency and a chapter to presentation and interaction aspects of query auto completion.
We end by discussing related tasks as well as potential research directions to further the area.
Related Results
Electronic Equipment Usage on Japanese Vehicles
Electronic Equipment Usage on Japanese Vehicles
<div class="htmlview paragraph">The application of a wide assortment of electronic systems to motor vehicles currently under serious consideration in the automotive and elect...
Recent Innovations in Offshore Completion and Workover Systems
Recent Innovations in Offshore Completion and Workover Systems
ABSTRACT
Humble Oil &Refining Company has developed an offshore completion and workover system, for use with multi-well fixed platform development, which util...
Named Entity Recognition in Statistical Dataset Search Queries
Named Entity Recognition in Statistical Dataset Search Queries
Search engines must understand user queries to provide relevant search results. Search engines can enhance their understanding of user intent by employing named entity recognition ...
Neural Embedding-Based Metrics for Pre-retrieval Query Performance Prediction
Neural Embedding-Based Metrics for Pre-retrieval Query Performance Prediction
<p>Pre-retrieval Query Performance Prediction (QPP) methods are oblivious to the performance of the retrieval model as they predict query difficulty prior to observing the se...
Neural Embedding-Based Metrics for Pre-retrieval Query Performance Prediction
Neural Embedding-Based Metrics for Pre-retrieval Query Performance Prediction
<p>Pre-retrieval Query Performance Prediction (QPP) methods are oblivious to the performance of the retrieval model as they predict query difficulty prior to observing the se...
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
RaPID-Query for Fast Identity by Descent Search and Genealogical Analysis
AbstractThe size of genetic databases has grown large enough such that, genetic genealogical search, a process of inferring familial relatedness by identifying DNA matches, has bec...
A New Remote Sensing Image Retrieval Method Based on CNN and YOLO
A New Remote Sensing Image Retrieval Method Based on CNN and YOLO
<>Retrieving remote sensing images plays a key role in RS fields, which activates researchers to design a highly effective extraction method of image high-level features. How...
Improving Sentence Retrieval Using Sequence Similarity
Improving Sentence Retrieval Using Sequence Similarity
Sentence retrieval is an information retrieval technique that aims to find sentences corresponding to an information need. It is used for tasks like question answering (QA) or nove...

