Breaking News: Grepper is joining You.com. Read the official announcement!

How to find the Levenshtein distance between two strings?

Wissam answered on December 26, 2023 Popularity 9/10 Helpfulness 3/10

answer How to find the Levenshtein distance between two strings?

How to find the Levenshtein distance between two strings?

Comment

def levenshtein_distance(str1, str2):
    # Swap strings if str1 is longer than str2
    if len(str1) > len(str2):
        str1, str2 = str2, str1

    # Initialize the previous row of distances
    previous_row = range(len(str1) + 1)
    for i, c1 in enumerate(str2):
        # Start a new row with the delete operation count
        current_row = [i + 1]
        for j, c2 in enumerate(str1):
            # Calculate costs for various operations
            insertions = previous_row[j + 1] + 1
            deletions = current_row[j] + 1
            substitutions = previous_row[j] + (c1 != c2)
            # Append the minimum cost of operations to current row
            current_row.append(min(insertions, deletions, substitutions))
        # Move to the next row
        previous_row = current_row

    # The last element of the previous row is the answer
    return previous_row[-1]

Popularity 9/10 Helpfulness 3/10 Language python

Source: Grepper

Tags: between find levenshtein-distance python

Link to this answer
Share Copy Link

Contributed on Dec 26 2023

Wissam

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

How to find the Levenshtein distance between two strings?

Contents

More Related Answers

How to find the Levenshtein distance between two strings?

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.