import Levenshtein fruits = ["apple", "banana", "cherry", "pear"] word = "bannnana" # Get similarity index for each fruit name scores = [Levenshtein.ratio(word, f) for f in fruits] # Find the closest matching fruit name closest_match = fruits[scores.index(max(scores))] print(closest_match) # Output: "banana"
import Levenshtein words = ["apple", "bananna", "cherry", "pear"] dictionary = ["apple", "banana", "cherry", "pear"] # Check spelling for each word for word in words: distances = [Levenshtein.distance(word, d) for d in dictionary] closest_word = dictionary[distances.index(min(distances))] print(f"{word} -> {closest_word}")Levenshtein is a third-party library package that needs to be installed separately. It can be installed using pip by running `pip install python-Levenshtein`.