A reader asked by email if it's effective to store a full-text search index in a DAWG and how does it compare with using a trie. DAWG is useful when you need a fuzzy search, e.g. for ignoring possible typos or spelling correction. If you don't need this, you can use a simpler data structure called suffix array.
Nice Article. Thanks..
Thank you for the link.
I tried the method used in "2.2.2 A better formula". Am able to get good results to a great extent. I would like to know the derivation of the formula...
"Timing in games is a completely different topic"
I'm curious as to why that is the case.
It seems to be used fairly widely.. rightly or wrongly.. but it isn't clear to me why it might be wrong, or what might be the preferred approach.
A ternary structure for storing dictionaries is proposed. The structure is based on ternary search trie that is "compressed" into a DAG by linking together equal subtrees. By using it, you can eliminate affix stripping and implement a faster spelling corrector.