Autofill, as a rule, is carried out similarly to spell checking. Here's an article from Nick Blog about Levenshtein Autonomus . It is written in python so you can follow. I said earlier because until this checks the spellchecker and suggests similar names, she will not be able to anticipate where popular queries are being made. To do this, a naive approach would be a binary search tree tree , in which you weighted the nodes based on the popularity of their search.
source
share