PHP Classes
elePHPant
Icontem

Damerau Levenshtein: Get text similarity level with Damerau-Levenshtein

Recommend this page to a friend!
  Info   View files View files (2)   DownloadInstall with Composer Download .zip   Reputation   Support forum   Blog    
Last Updated Ratings Unique User Downloads Download Rankings
2011-07-12 (5 years ago) RSS 2.0 feedNot enough user ratingsTotal: 533 This week: 1All time: 5,323 This week: 954Up
Version License PHP version Categories
damerau-levenshtein 0.1BSD License5.0Algorithms, PHP 5, Text processing
Description Author

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.

Innovation Award
PHP Programming Innovation award nominee
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
Picture of Ph4r05
Name: Ph4r05 <contact>
Classes: 1 package by
Country: Slovak Republic Slovak Republic
Age: ???
All time rank: 300316 in Slovak Republic Slovak Republic
Week rank: 811 Up6 in Slovak Republic Slovak Republic Up
Innovation award
Innovation award
Nominee: 1x

  Files folder image Files  
File Role Description
Plain text file class.damerauLevenshtein.php Class DamerauLevenshtein main class
Accessible without login Plain text file example.damerauLevenshtein.php Example Example of usage

 Version Control Unique User Downloads Download Rankings  
 0%
Total:533
This week:1
All time:5,323
This week:954Up