Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dounhill (0) - 1 freq doonhill (1) - 6 freq downhill (1) - 1 freq cornhill (2) - 5 freq dunghill (2) - 1 freq toonhill (2) - 1 freq downhall (2) - 2 freq gunhill (2) - 2 freq sornhill (2) - 1 freq domnhall (2) - 1 freq govanhill (3) - 1 freq muthill (3) - 1 freq tonyhill (3) - 1 freq uphill (3) - 3 freq duill (3) - 1 freq counsall (3) - 3 freq downfall (3) - 1 freq doughie (3) - 1 freq dounhaud (3) - 1 freq rosehill (3) - 3 freq thornhill (3) - 4 freq dhomnuill (3) - 1 freq council (3) - 58 freq doubil (3) - 3 freq cranhill (3) - 3 freq |
dounhill (0) - 1 freq doonhill (1) - 6 freq downhill (2) - 1 freq gunhill (3) - 2 freq downhall (3) - 2 freq domnhall (3) - 1 freq toonhill (3) - 1 freq dunghill (3) - 1 freq donnell (4) - 1 freq cornhill (4) - 5 freq tonyhill (4) - 1 freq sornhill (4) - 1 freq oneill (5) - 2 freq quhill (5) - 1 freq cooncill (5) - 1 freq counsell (5) - 1 freq caunill (5) - 1 freq barnhill (5) - 1 freq bowhill (5) - 5 freq donella (5) - 5 freq donnelly (5) - 1 freq finhall (5) - 22 freq doughball (5) - 1 freq danbell (5) - 2 freq denholm (5) - 1 freq |
SoundEx code - D540 doonhill - 6 freq donal - 7 freq denial - 14 freq dinah'll - 9 freq daniel - 128 freq doon-low - 1 freq demmle - 2 freq 'daniel - 1 freq dwinnle - 1 freq doonlow - 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 |
DOUNHILL |
Time to execute Levenshtein function - 0.270194 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.372427 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.028434 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.037924 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.000930 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. |