note 100589 added to function.levenshtein

/* PHP Levenshtein function with best performance and minimal memory usage. */ function distance($source, $dest) { if ($source == $dest) return 0; $slen = strlen($source); $dlen = strlen($dest); $dist = array(0 => range(0, $dlen)); for ($i = 0; $i < $slen; $i++) { $next_i = $i + 1; $dist[$next_i] = array($next_i); for ($j = 0; $j < $dlen; $j++) { $cost = $source{$i} == $dest{$j} ? 0 : 1; $dist[$next_i][$j + 1] = min( $dist[$i][$j + 1] + 1, // deletion $dist[$next_i][$j] + 1, // insertion $dist[$i][$j] + $cost // substitution ); } unset($dist[$i]); } return $dist[$i][$j]; } ---- Server IP: 69.147.83.197 Probable Submitter: 46.118.154.84 ---- Manual Page -- http://www.php.net/manual/en/function.levenshtein.php Edit -- https://master.php.net/note/edit/100589 Del: integrated -- https://master.php.net/note/delete/100589/integrated Del: useless -- https://master.php.net/note/delete/100589/useless Del: bad code -- https://master.php.net/note/delete/100589/bad+code Del: spam -- https://master.php.net/note/delete/100589/spam Del: non-english -- https://master.php.net/note/delete/100589/non-english Del: in docs -- https://master.php.net/note/delete/100589/in+docs Del: other reasons-- https://master.php.net/note/delete/100589 Reject -- https://master.php.net/note/reject/100589 Search -- https://master.php.net/manage/user-notes.php