 Early algorithms for on-line approximate matching were suggested by Wagner and Fisher and by Sellers.Both algorithms are based on dynamic programming but solve different problems.Sellers' algorithm searches approximately for a substring in a text while the algorithm of Wagner and Fisher calculates Levenshtein distance, being appropriate for dictionary fuzzy search only.