Created
July 31, 2014 15:39
-
-
Save manniru/8d0300505afdb5dd1c42 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?php | |
// input misspelled word | |
$input = 'carrrot'; | |
// array of words to check against | |
$words = array('apple','pineapple','banana','orange', | |
'radish','carrot','pea','bean','potato'); | |
// no shortest distance found, yet | |
$shortest = -1; | |
// loop through words to find the closest | |
foreach ($words as $word) { | |
// calculate the distance between the input word, | |
// and the current word | |
$lev = levenshtein($input, $word); | |
// check for an exact match | |
if ($lev == 0) { | |
// closest word is this one (exact match) | |
$closest = $word; | |
$shortest = 0; | |
// break out of the loop; we've found an exact match | |
break; | |
} | |
// if this distance is less than the next found shortest | |
// distance, OR if a next shortest word has not yet been found | |
if ($lev <= $shortest || $shortest < 0) { | |
// set the closest match, and shortest distance | |
$closest = $word; | |
$shortest = $lev; | |
} | |
} | |
echo "Input word: $input\n"; | |
if ($shortest == 0) { | |
echo "Exact match found: $closest\n"; | |
} else { | |
echo "Did you mean: $closest?\n"; | |
} | |
?> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment