Package com.google.errorprone.names

Class LevenshteinEditDistance

java.lang.Object

com.google.errorprone.names.LevenshteinEditDistance

public class LevenshteinEditDistance
extends Object

A utility class for finding the Levenshtein edit distance between strings. The edit distance between two strings is the number of deletions, insertions, and substitutions required to transform the source to the target. See https://en.wikipedia.org/wiki/Levenshtein_distance.

Author:

eaftan@google.com (Eddie Aftandilian)

Method Summary

Modifier and Type	Method	Description
static int	getEditDistance(String source, String target)	Returns the edit distance between two strings.
static int	getEditDistance(String source, String target, boolean caseSensitive)	Returns the edit distance between two strings.
static int	getWorstCaseEditDistance(int sourceLength, int targetLength)	Calculate the worst case distance between two strings with the given lengths

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

getEditDistance

public static int getEditDistance(String source,
 String target)

Returns the edit distance between two strings.

Parameters:

source - The source string.

target - The target distance.

Returns:

The edit distance between the source and target string.

See Also:

• getEditDistance(String, String, boolean)

getEditDistance

public static int getEditDistance(String source,
 String target,
 boolean caseSensitive)

Returns the edit distance between two strings. The algorithm used to calculate this distance has space requirements of len(source)*len(target).

Parameters:

source - The source string.

target - The target string

caseSensitive - If true, case is used in comparisons and 'a' != 'A'.

Returns:

The edit distance between the source and target strings.

See Also:

• getEditDistance(String, String)

getWorstCaseEditDistance

public static int getWorstCaseEditDistance(int sourceLength,
 int targetLength)

Calculate the worst case distance between two strings with the given lengths