I want to implement incremental search on a list of strings. Consider I have an array containing which contains the strings store,state,stamp,crawl,crow. My application has a te
I've had to do something similar in the past, using a collection that contained approximately 500,000 words. I found that a directed acyclic word graph worked well. A DAWG has roughly the same performance as a trie, but will be more space efficient. It is, however, slightly more complex to implement.
Unfortunately, my work was in C, and I don't have a good reference for a DAWG implementation in C#.