Package org.eblocker.server.common.util

Class Levenshtein<T>

java.lang.Object

org.eblocker.server.common.util.Levenshtein<T>

public class Levenshtein<T>
extends Object

Levenshtein's Distance Algorithm

Calculates the minimum edit distance between two lists (generalized from strings) including edit sequence.

This implementation distinguishes between substitutions x->y and x->x named substitution and no operation here.

Default cost functions are:

• deletion: + 1
• insertion: + 1
• substitution: + 2
• no operation: + 0

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	Levenshtein.Builder<T>
static class	Levenshtein.Distance
static class	Levenshtein.DistanceMatrixEntry
static enum	Levenshtein.Operation

Method Summary

Modifier and Type	Method	Description
<T> Levenshtein.Distance	distance(List<T> source, List<T> target)

Methods inherited from class java.lang.Object

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

Method Details

distance

public <T> Levenshtein.Distance distance(List<T> source,
 List<T> target)