| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| downhall (0) - 2 freq downfall (1) - 1 freq downhill (1) - 1 freq domnhall (1) - 1 freq doonhill (2) - 6 freq dounhill (2) - 1 freq bowhill (3) - 5 freq cornhill (3) - 5 freq goodhall (3) - 1 freq gornall (3) - 1 freq donnell (3) - 1 freq toonhill (3) - 1 freq donal (3) - 7 freq cornwall (3) - 9 freq counsall (3) - 3 freq sornhill (3) - 1 freq donnal (3) - 1 freq dwall (3) - 10 freq finhall (3) - 22 freq doonhame (3) - 2 freq dounhaud (3) - 1 freq dow'll (3) - 1 freq doughball (3) - 1 freq whall (3) - 1 freq joshhall (3) - 1 freq |
downhall (0) - 2 freq downhill (1) - 1 freq domnhall (2) - 1 freq downfall (2) - 1 freq dounhill (3) - 1 freq doonhill (3) - 6 freq sornhill (5) - 1 freq dwall (5) - 10 freq finhall (5) - 22 freq whall (5) - 1 freq toonhill (5) - 1 freq donnell (5) - 1 freq cornhill (5) - 5 freq dow'll (5) - 1 freq bowhill (5) - 5 freq dwell (6) - 11 freq whill (6) - 13 freq donnelly (6) - 1 freq donella (6) - 5 freq duanalla (6) - 1 freq dunghill (6) - 1 freq govanhill (6) - 1 freq barnhill (6) - 1 freq dancehall (6) - 1 freq danbell (6) - 2 freq |
SoundEx code - D540 doonhill - 6 freq donal - 7 freq denial - 14 freq dinah'll - 9 freq daniel - 127 freq doon-low - 1 freq demmle - 2 freq 'daniel - 1 freq dwinnle - 1 freq dunloy - 4 freq dinnle - 2 freq dam'll - 1 freq dwamly - 1 freq donnal - 1 freq danielle - 1 freq downhill - 1 freq demmel - 1 freq dounhill - 1 freq dunneil - 1 freq dumela - 1 freq danelaw - 3 freq dhomnuill - 1 freq dimly - 3 freq donella - 5 freq dinnil - 1 freq €™dinnle - 1 freq €˜daniel - 7 freq donnell - 1 freq donnelly - 1 freq dunollie - 6 freq downhall - 2 freq daniella - 1 freq duanalla - 1 freq domnhall - 1 freq dunli - 1 freq daniela - 2 freq |
MetaPhone code - TNHL doonhill - 6 freq toonhill - 1 freq tinhalla - 1 freq downhill - 1 freq dounhill - 1 freq tannahill - 7 freq tonyhill - 1 freq downhall - 2 freq |
DOWNHALL |
| Time to execute Levenshtein function - 0.349704 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.504257 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.039150 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.055706 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000802 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |