Dawg
Directed acyclic word graph
A directed acyclic word graph (DAWG) is a
data structure in computer science similar to a
trie but much more space efficient. It is used to represent a set of
strings and supports a constant time search operation. The lookup time is proportional to the length of the search string and is the same as an equivalent trie.
See more at Wikipedia.org...