blogspot.software_and_algorithms.stern_library.string

Class DamerauLevenshteinAlgorithm

java.lang.Object

blogspot.software_and_algorithms.stern_library.string.DamerauLevenshteinAlgorithm

public class DamerauLevenshteinAlgorithm
extends Object

The Damerau-Levenshtein Algorithm is an extension to the Levenshtein Algorithm which solves the edit distance problem between a source string and a target string with the following operations:

• Character Insertion
• Character Deletion
• Character Replacement
• Adjacent Character Swap

Note that the adjacent character swap operation is an edit that may be applied when two adjacent characters in the source string match two adjacent characters in the target string, but in reverse order, rather than a general allowance for adjacent character swaps.

This implementation allows the client to specify the costs of the various edit operations with the restriction that the cost of two swap operations must not be less than the cost of a delete operation followed by an insert operation. This restriction is required to preclude two swaps involving the same character being required for optimality which, in turn, enables a fast dynamic programming solution.

The running time of the Damerau-Levenshtein algorithm is O(n*m) where n is the length of the source string and m is the length of the target string. This implementation consumes O(n*m) space.

Author:

Kevin L. Stern

Constructor Summary

Constructors

Constructor and Description
DamerauLevenshteinAlgorithm(int deleteCost, int insertCost, int replaceCost, int swapCost) Constructor.

Method Summary

Modifier and Type	Method and Description
int	execute(String source, String target) Compute the Damerau-Levenshtein distance between the specified source string and the specified target string.

Methods inherited from class java.lang.Object

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

Constructor Detail

DamerauLevenshteinAlgorithm

public DamerauLevenshteinAlgorithm(int deleteCost,
                                   int insertCost,
                                   int replaceCost,
                                   int swapCost)

Constructor.

Parameters:

deleteCost - the cost of deleting a character.

insertCost - the cost of inserting a character.

replaceCost - the cost of replacing a character.

swapCost - the cost of swapping two adjacent characters.

Method Detail

execute

public int execute(String source,
                   String target)

Compute the Damerau-Levenshtein distance between the specified source string and the specified target string.

Parameters:

source - the source string

target - the target string

Returns:

Damerau-Levenshtein distance between the specified source