| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daither (0) - 1 freq dither (1) - 2 freq naither (1) - 63 freq faither (1) - 1385 freq baither (1) - 2 freq maither (1) - 1 freq gaither (1) - 82 freq raither (1) - 273 freq taither (1) - 1 freq aither (1) - 140 freq laither (1) - 2 freq whither (2) - 132 freq faithey (2) - 1 freq naiter (2) - 2 freq maitcer (2) - 1 freq father (2) - 79 freq egither (2) - 5 freq laithern (2) - 1 freq baithert (2) - 1 freq maiter (2) - 67 freq bither (2) - 12 freq waiter (2) - 34 freq paitter (2) - 1 freq laicher (2) - 5 freq swither (2) - 31 freq |
daither (0) - 1 freq dither (1) - 2 freq taither (2) - 1 freq aither (2) - 140 freq dithery (2) - 1 freq raither (2) - 273 freq laither (2) - 2 freq dother (2) - 36 freq gaither (2) - 82 freq naither (2) - 63 freq faither (2) - 1385 freq maither (2) - 1 freq baither (2) - 2 freq alther (3) - 1 freq anther (3) - 2 freq laithery (3) - 1 freq nither (3) - 5 freq wather (3) - 75 freq inither (3) - 7 freq ainther (3) - 3 freq daiths (3) - 10 freq nayther (3) - 1 freq daith (3) - 286 freq cither (3) - 1 freq aether (3) - 1 freq |
SoundEx code - D360 dother - 36 freq doatery - 1 freq dither - 2 freq dooter - 3 freq detour - 7 freq dowter - 8 freq deter - 4 freq dietary - 1 freq doddery - 5 freq deid-thraw - 1 freq dotir - 1 freq dudder - 1 freq dithery - 1 freq deid-thraa - 1 freq daither - 1 freq dotterie - 1 freq dater - 1 freq doddieweir - 1 freq dottir - 1 freq doiter - 1 freq |
MetaPhone code - T0R tither - 202 freq dother - 36 freq dither - 2 freq tether - 18 freq t'ither - 7 freq tother - 1 freq t'other - 1 freq taither - 1 freq tithyr - 1 freq dithery - 1 freq daither - 1 freq tithir - 1 freq touther - 1 freq |
DAITHER |
| Time to execute Levenshtein function - 0.230100 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.383111 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.027682 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.040691 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.000854 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. |