(PHP 4 >= 4.0.1, PHP 5, PHP 7)
Calculate Levenshtein distance between two strings
int levenshtein ( string $str1, string $str2 )
int levenshtein ( string $str1 , string $str2 , int $cost_ins , int $cost_rep , int $cost_del )
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform str1 into str2. The complexity of the algorithm is O(m*n), where n and m are
