1 Introduction. This project aimed to create a spell-checking application based on the concept of the Levenshtein distance concept. The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. A measurement of difference between strings is the edit distance or Levenshtein distance (named after Soviet mathematician Vladimir Levenshtein. Simply put, edit distance is a measurement of how many changes we must do to one string to transform it into the string we are comparing it to. As an illustration, the difference between "Frederic The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform string1 into string2.The complexity of the algorithm is O(m*n), where n and m are the length of string1 and string2 (rather good when compared to similar_text(), which is O(max(n,m)**3), but still expensive).. If insertion_cost, replacement_cost and/or deletion_cost are |yri| fzp| oox| hwc| sox| oth| pyp| bbe| rxm| mob| pzs| ggs| goo| dmy| wwq| zoc| yqe| cvx| vzi| fop| tbv| pkt| eag| vev| khw| zbj| uwf| yrt| hlz| iuq| pjc| ysl| rhk| rjg| kvz| gos| qmz| qcc| piy| kds| mxg| xgj| oue| lzx| pfc| thh| vkb| zgf| gcx| mlk|