Home/ Questions/Q 91763
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-10T23:04:51+00:00

Is there anything better than a Trie for this situation? Storing a list of

  • 0

Is there anything better than a Trie for this situation?

  • Storing a list of ~100k English words
  • Needs to use minimal memory
  • Lookups need to be reasonable, but don’t have to be lightning fast

I’m working with Java, so my first attempt was to just use a Set<String>. However, I’m targeting a mobile device and already running low on memory. Since many English words share common prefixes, a trie seems like a decent bet to save some memory — anyone know some other good options?

EDIT – More info – The data structure will be used for two operations

  • Answering: Is some word XYZ in the list?
  • Generating the neighborhood of words around XYZ with one letter different

Thanks for the good suggestions

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. What are you doing? If it’s spell checking, you could use a bloom filter – see this code kata.

    • 0