function call:
int levenshtein( string $str1, string $str2 [, int $cost_ins, int $cost_rep, int $cost_del ] )

description:
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform $str1 into $str2.
In its simplest form the function will take only the two strings as parameter and will calculate just the number of insert, replace and delete operations needed to transform $str1 into $str2.
A second variant will take three additional parameters that define the cost of insert, replace and delete operations. This is more general and adaptive than variant one, but not as efficient.

test levenshtein online:

$str1

$str2

$cost_ins

$cost_rep

$cost_del

Popular:
md5    base64_decode    Generate Password    base64_encode    Google Pagerank    preg_match    unserialize
Last:
md5    base64_decode    strlen    base64_encode    urlencode    unserialize    json_decode