| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auldhill (0) - 26 freq beldhill (2) - 2 freq auldhill's (2) - 2 freq guidwill (3) - 3 freq auldyin (3) - 1 freq quhill (3) - 1 freq auldgit (3) - 1 freq fullfill (3) - 3 freq dunghill (3) - 1 freq wellhill (3) - 1 freq ahill (3) - 1 freq gunhill (3) - 2 freq auldwife (3) - 1 freq auldyins (3) - 1 freq auldies (3) - 1 freq auldrife (3) - 1 freq ahoghill (3) - 5 freq auldtime (3) - 2 freq hardhill (3) - 2 freq uphill (3) - 3 freq auld-ails (3) - 1 freq auchmill (3) - 3 freq muthill (3) - 1 freq windyhill (4) - 1 freq fuddilt (4) - 2 freq |
auldhill (0) - 26 freq beldhill (3) - 2 freq auldhill's (4) - 2 freq muthill (5) - 1 freq gunhill (5) - 2 freq auld-ails (5) - 1 freq hardhill (5) - 2 freq ahill (5) - 1 freq ahoghill (5) - 5 freq wellhill (5) - 1 freq quhill (5) - 1 freq goodhall (5) - 1 freq guidwill (5) - 3 freq uphill (5) - 3 freq alkoholl (5) - 1 freq leidhills (5) - 1 freq hill (6) - 461 freq rosehill (6) - 3 freq thill (6) - 1 freq acshull (6) - 1 freq bowhill (6) - 5 freq quheill (6) - 1 freq tonyhill (6) - 1 freq leill (6) - 1 freq alsweill (6) - 1 freq |
SoundEx code - A434 auldhill - 26 freq auldhill's - 2 freq auld-ails - 1 freq auldlangsyne - 2 freq alithealki - 2 freq |
MetaPhone code - ALTHL auldhill - 26 freq |
AULDHILL |
| Time to execute Levenshtein function - 0.170248 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.323776 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.027164 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.036837 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.000838 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. |