DeepAI AI Chat
Log In Sign Up

An O(k logn) algorithm for prefix based ranked autocomplete

by   Dhruv Matani, et al.

Many search engines such as Google, Bing Yahoo! show search suggestions when users enter search phrases on their interfaces. These suggestions are meant to assist the user in finding what she wants quickly and also suggesting common searches that may result in finding information that is more relevant. It also serves the purpose of helping the user if she is not sure of what to search for, but has a vague idea of what it is that she wants. We present an algorithm that takes time proportional to O(k logn), and O(n) extra space for providing the user with the top k ranked suggestions out of a corpus of n possible suggestions based on the prefix of the query that she has entered so far.


page 1

page 2

page 3

page 4


Towards a machine-readable literature: finding relevant papers based on an uploaded powder diffraction pattern

We investigate a prototype application for machine-readable literature. ...

You Are How (and Where) You Search? Comparative Analysis of Web Search Behaviour Using Web Tracking Data

We conduct a comparative analysis of desktop web search behaviour of use...

Interactive Video Corpus Moment Retrieval using Reinforcement Learning

Known-item video search is effective with human-in-the-loop to interacti...

Medical Information Retrieval and Interpretation: A Question-Answer based Interaction Model

The Internet has become a very powerful platform where diverse medical i...

Aspect-based Academic Search using Domain-specific KB

Academic search engines allow scientists to explore related work relevan...

Searching to Learn with Instructional Scaffolding

Search engines are considered the primary tool to assist and empower lea...