🔗 The Levenshtein algorithm calculates the similarity of two strings based on how many characters you must add, substitute, or remove to make them the same.