Skip to main content
Neil's user avatar
Neil's user avatar
Neil's user avatar
Neil
  • Member for 3 years, 9 months
  • Last seen more than a week ago
comment
comment
Efficient data structures for building a fast spell checker
That picture is an ordinary radix tree. A Patricia trie is a binary radix tree; necessarily it is a full binary tree. When matching a string, it does not use any duplicate substrings, but skips the bits that are not in the trie. If you get a candidate match, one must verify that all the skipped bits match.
awarded
awarded