@*Shashank : *i guess using TRIE for spell check is not a good option because 1) dictionary is too large , it would take lot of time for creating trie for all word in the dictionary. 2) space consumption will be too large . there are algorithmn in which we can optimize space but still it would take lot of space. 3) TRIE will not give you closet match to the give input, it just give you say n number of the matching pair. those n match may not be the closest one. 5) what if 1st alphabet of the given input is wrong ,Trie will traverse wrong branch. 4) creating trie and traversing to find all combination is kinda messy....i guess
On Mon, Feb 6, 2012 at 1:45 AM, WgpShashank <[email protected]>wrote: > @ravi .. why don't try with "TRIE" > > > > > -- > *Thanks > Shashank Mani Narayan > Computer Science & Engineering > Birla Institute of Technology,Mesra > ** Founder Cracking The Code Lab "http://shashank7s.blogspot.com/"* > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/O7OYXAdKBNYJ. > > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
