These algorithms are used for calculating the minimum number of insertions, deletions, or substitutions required to transform one string into another. Some popular Edit Distance algorithms include Levenshtein distance, Damerau-Levenshtein distance, and Hamming distance.