check this blog http://nlpb.blogspot.com/2011/01/spell-checker.html
On Sun, Jan 29, 2012 at 3:07 AM, Ravi Ranjan <[email protected]>wrote: > 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 [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. > -- Thanks & Regards Saurabh Yadav -- 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.
