 |
|
Innovation award
 Nominee: 1x |
This class can compute similarity level between strings with Damerau-Levenshtein distance.
It takes two strings as parameters and computes the Damerau-Levenshtein edit distance between them.
The class can compute the relative similarity between the two strings based on Damerau-Levenshtein distance.
 July 2011
Number 5 |
The Levenshtein algorithm is a popular algorithm for determining the similarity level of two text strings.
The Damerau-Levenshtein algorithm is a variation of the Levenshtein algorithm that allows the addition, deletion, substitution, and the transposition of two adjacent characters when determining the strings similarity.
This class is a pure PHP implementation of the Damerau-Levenshtein algorithm.
Manuel Lemos |
| Not yet rated by the users |
| |
Applications that use this class |
|
|
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.
| |
Files |
|
|