| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| withhaudin (0) - 1 freq withhaud (2) - 1 freq oot-haudin (3) - 2 freq withstandin (3) - 1 freq inhaudin (3) - 1 freq withouten (4) - 2 freq fithauds (4) - 1 freq doonhaudin (4) - 2 freq behaudin (4) - 3 freq withstanding (4) - 1 freq witchin (4) - 2 freq withstaun (4) - 2 freq witherin (4) - 4 freq uphaudin (4) - 42 freq inhauddin (4) - 1 freq inhauden (4) - 2 freq withheld (4) - 1 freq fithaud (4) - 3 freq within (4) - 189 freq whaurin (4) - 5 freq staudin (4) - 1 freq haudin (4) - 380 freq misbehaudin (4) - 1 freq hauldin (5) - 10 freq 'ithin (5) - 2 freq |
withhaudin (0) - 1 freq withhaud (3) - 1 freq oot-haudin (5) - 2 freq withstaun (6) - 2 freq witherin (6) - 4 freq within (6) - 189 freq withheld (6) - 1 freq witchin (6) - 2 freq withstandin (6) - 1 freq withouten (6) - 2 freq inhaudin (6) - 1 freq threidin (7) - 2 freq thuddin (7) - 3 freq wthin (7) - 1 freq withered (7) - 7 freq withdraan (7) - 1 freq misbehaudin (7) - 1 freq watherin (7) - 1 freq withen (7) - 5 freq watchin (7) - 395 freq whiddin (7) - 1 freq watchan (7) - 20 freq withooten (7) - 2 freq fithaud (7) - 3 freq inhauddin (7) - 1 freq |
SoundEx code - W335 withouten - 2 freq withoot-maybe - 2 freq withooten - 2 freq withhaudin - 1 freq |
MetaPhone code - W0TN withouten - 2 freq withooten - 2 freq withhaudin - 1 freq |
WITHHAUDIN |
| Time to execute Levenshtein function - 0.211661 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.369064 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.027581 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.048292 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.000950 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. |