Some tries can require more space than a hash table, as memory may be allocated for each character in the search string, rather than a single chunk of memory for the whole entry, as in most hash tables.
Tries are also well suited for implementing approximate matching algorithms,[REF] including those used in spell checking and hyphenation[REF] software.