Query autocompletion is an essential feature in search engines that predicts and suggests query completions to a user's incomplete prefix input, a critical feature to enhance the user experience. While a generic lookup-based system can provide completions with great efficiency, it is unable to address prefixes not seen in the past. On the other hand, a generative system can complete unseen queries with superior accuracy but requires substantial computational overhead at runtime, making it costly for a large-scale system. Here, we present an efficient, fully-generative query autocompletion framework. Our framework employs an n-gram language model at a subword-level and exploits the n-gram model's inherent data structure to precompute completions prior to runtime. Evaluation results on public dataset show that our framework is not only as effective as previous systems with neural language models, but also reduces computational overhead at runtime, expediting the speed by more than two orders of magnitude. The goal of this work is to showcase a generative query completion system that is an attractive choice for large-scale deployments.
CITATION STYLE
Kang, Y. M., Liu, W., & Zhou, Y. (2021). QueryBlazer: Efficient Query Autocompletion Framework. In WSDM 2021 - Proceedings of the 14th ACM International Conference on Web Search and Data Mining (pp. 1020–1028). Association for Computing Machinery, Inc. https://doi.org/10.1145/3437963.3441725
Mendeley helps you to discover research relevant for your work.