| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doun-hauddit (0) - 1 freq doun-hauddin (1) - 1 freq up-hauddit (3) - 1 freq doun-hauden (3) - 2 freq in-hauddit (3) - 1 freq open-haundit (4) - 1 freq hook-haundit (4) - 17 freq doon-haundelt (4) - 7 freq doon-haulin (4) - 1 freq bak-hauddit (4) - 1 freq doun-loadit (4) - 1 freq up-haudit (4) - 1 freq dounhauden (4) - 2 freq uphauddit (4) - 2 freq doonhaudin (4) - 2 freq dounladit (4) - 2 freq doungradit (4) - 1 freq dounhaud (4) - 1 freq hauddit (5) - 18 freq unfauldit (5) - 4 freq doun-whummilt (5) - 1 freq reid-haundit (5) - 2 freq uphauddin (5) - 2 freq oot-haudin (5) - 2 freq doonhauder (5) - 1 freq |
doun-hauddit (0) - 1 freq doun-hauddin (2) - 1 freq in-hauddit (4) - 1 freq doun-hauden (5) - 2 freq up-hauddit (5) - 1 freq bak-hauddit (6) - 1 freq doun-loadit (6) - 1 freq open-haundit (6) - 1 freq doon-haundelt (6) - 7 freq doon-hertit (7) - 3 freq dounhaud (7) - 1 freq doon-loadit (7) - 4 freq dounladit (7) - 2 freq dug-heidit (7) - 2 freq doungradit (7) - 1 freq doonhaudin (7) - 2 freq hook-haundit (7) - 17 freq doon-haulin (7) - 1 freq dounhauden (7) - 2 freq uphauddit (7) - 2 freq up-haudit (7) - 1 freq door-haundle (8) - 1 freq twa-haundit (8) - 3 freq bak-hauddin (8) - 1 freq 'doon-hauden' (8) - 1 freq |
SoundEx code - D533 duntit - 25 freq dintit - 3 freq denotit - 1 freq day-in-day-oot - 1 freq dented - 2 freq dauntit - 3 freq duntet - 1 freq dunteth - 1 freq donated - 2 freq dunted - 6 freq dentit - 3 freq denotational - 1 freq denotations - 2 freq doun-hauddit - 1 freq demotit - 1 freq dentition - 1 freq dontdoit - 3 freq donateaticket - 1 freq dnddad - 1 freq |
MetaPhone code - TNHTT doun-hauddit - 1 freq |
DOUN-HAUDDIT |
| Time to execute Levenshtein function - 0.193788 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.391306 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.027817 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.036790 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.000832 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. |