A Novel Algorithm for Correcting Lexical Errors in Data Mining using Levenshtein Distance and Hierarchical Clustering

Internet searchers have turn into the essential method for getting to data on the Web. In any case, late studies show incorrectly spelled words are exceptionally regular in inquiries to these frameworks. At the point when clients incorrectly spell a question, the outcomes are erroneous or give uncertain data. In this work, a hierarchical clustering based Lexicon correction algorithm using Levenshtein Distance for misspelling detection and correction.