coreynorthcutt

/*
* Ideal Levenshtein comparison from 0 to 100: 0 being the most similar, 100 being the least
*/
function levenshteinDistance($str1, $str2) {
    $len1 = mb_strlen($str1);
    $len2 = mb_strlen($str2);
   
    // strip common prefix
    $i = 0;
    do {