| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-dernt (0) - 1 freq hauf-turnt (2) - 1 freq hauf-decent (2) - 1 freq hauf-daft (3) - 1 freq hauf-spent (3) - 1 freq hauf-deid (3) - 8 freq hauf-pint (3) - 1 freq hauf-serene (3) - 1 freq hauf-hertit (3) - 1 freq haufdecent (3) - 1 freq haurdent (3) - 1 freq hauf-feart (3) - 2 freq hauf-light (4) - 2 freq hauf-seas (4) - 1 freq hauf-threy (4) - 1 freq hauf-mast (4) - 3 freq hauf-empty (4) - 1 freq hauf-past (4) - 7 freq half-tirn (4) - 1 freq hauf-licht (4) - 6 freq haufers (4) - 4 freq hauf-yin (4) - 10 freq hauf-thrie (4) - 1 freq hauf-apen (4) - 2 freq faur-kennt (4) - 2 freq |
hauf-dernt (0) - 1 freq hauf-decent (3) - 1 freq hauf-turnt (3) - 1 freq hauf-hertit (5) - 1 freq haufdecent (5) - 1 freq hauf-serene (5) - 1 freq hauf-spent (5) - 1 freq hauf-daft (5) - 1 freq hauf-feart (5) - 2 freq hauf-pint (5) - 1 freq hauf-turnin (6) - 2 freq haaf-tirrt (6) - 1 freq haurdent (6) - 1 freq hauf-deid (6) - 8 freq hauf-grue (7) - 1 freq half-pint (7) - 1 freq hundert (7) - 7 freq hauf-a-meenit (7) - 1 freq hauf-shut (7) - 2 freq hauf-likit (7) - 1 freq half-done (7) - 1 freq hauf-muin (7) - 1 freq hauf-mete (7) - 1 freq hauf-day (7) - 1 freq hauf-won (7) - 1 freq |
SoundEx code - H136 hauf-thrie - 1 freq hauf-threy - 1 freq haaf-drucken - 1 freq hauf-dernt - 1 freq hauf-turnin - 2 freq hauf-thrappled - 1 freq hauf-throu - 1 freq haaf-tirrt - 1 freq hauf-three - 1 freq hauf-turnt - 1 freq hwptrtijm - 1 freq hypothermia - 1 freq hippodrome - 2 freq |
MetaPhone code - HFTRNT hauf-dernt - 1 freq hauf-turnt - 1 freq |
HAUF-DERNT |
| Time to execute Levenshtein function - 0.220297 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.375213 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.027755 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.037747 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.000935 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. |