What is the best data structure for automatically completing text?

Question

I have a long list of words, and I want to show words starting with text entered by the user. When the user enters a character, the application should update the list specified by the user. It should be like an AutoCompleteTextView on Android. I'm just curious about the best data structure for storing words so that the search is very fast.

Answer 1

You can use trie. http://en.wikipedia.org/wiki/Trie https://stackoverflow.com/search?q=trie

Good article - http://www.sarathlakshman.com/2011/03/03/implementing-autocomplete-with-trie-data-structure/

PS: , " ", , trix radix, trie, node - http://en.wikipedia.org/wiki/Radix_tree

Answer 2

:

• ?

, , .

Answer 3

(TST):

http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/

, , .

http://en.wikipedia.org/wiki/Generalised_suffix_tree

Answer 4

Tries (and their various varieties) are useful here. A more detailed reference on this topic is contained in this document . Maybe you can implement trie completion for Android?