i wanna write the "spell check function" like when we put some word with spelling mistake then it tell the most suitable word matching to it( green error line of spelling in MS-Word)
i used "levenshtein distance " algorithm to find the subset from the dictionary but it is a linear search... and takes much...... so is there any other data structure or approach to solve the problem to reduce complexity....... or "levenshtein distance " algorithm can be used in some other way -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
