Package blogspot.software_and_algorithms.stern_library.string

Class Summary

Class	Description
DamerauLevenshteinAlgorithm	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.
KnuthMorrisPrattAlgorithm	An implementation of the Knuth Morris Pratt substring search algorithm.