edu.illinois.cs.cogcomp.core.algorithms

Class LevensteinDistance

java.lang.Object

edu.illinois.cs.cogcomp.core.algorithms.LevensteinDistance

Direct Known Subclasses:

DameraoLevenstein

public abstract class LevensteinDistance
extends Object

This class provides implementations of Levenstein distance.

Author:

Vivek Srikumar

Constructor Summary

Constructors

Constructor and Description
LevensteinDistance()

Method Summary

Modifier and Type	Method and Description
static <T> int	getLevensteinDistance(List<T> s1, List<T> s2) Get the Levenstein distance between the two lists s1 and s2.
static int	getLevensteinDistance(String s1, String s2) Get the Levenstein distance between two strings s1 and s2
static <T> int	getLevensteinDistance(T[] s1, T[] s2) Get the Levenstein distance between the two arrays s1 and s2
static String	getNearestMatch(String s, String[] array) Given the input string s, get the string in the input array that is closest to s in terms of Levenstein distance.

Methods inherited from class java.lang.Object

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

Constructor Detail

LevensteinDistance

public LevensteinDistance()

Method Detail

getLevensteinDistance

public static <T> int getLevensteinDistance(List<T> s1,
                                            List<T> s2)

Get the Levenstein distance between the two lists s1 and s2.

getLevensteinDistance

public static <T> int getLevensteinDistance(T[] s1,
                                            T[] s2)

Get the Levenstein distance between the two arrays s1 and s2

getLevensteinDistance

public static int getLevensteinDistance(String s1,
                                        String s2)

Get the Levenstein distance between two strings s1 and s2

getNearestMatch

public static String getNearestMatch(String s,
                                     String[] array)

Given the input string s, get the string in the input array that is closest to s in terms of Levenstein distance.