| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daither (0) - 1 freq maither (1) - 1 freq aither (1) - 141 freq laither (1) - 2 freq faither (1) - 1391 freq baither (1) - 2 freq dither (1) - 2 freq raither (1) - 273 freq taither (1) - 1 freq gaither (1) - 83 freq naither (1) - 63 freq bather (2) - 59 freq leither (2) - 5 freq dailer (2) - 1 freq wither (2) - 143 freq watther (2) - 4 freq taicher (2) - 3 freq naitter (2) - 1 freq aithers (2) - 7 freq baithe (2) - 3 freq faithers (2) - 85 freq waitter (2) - 56 freq either (2) - 458 freq faithur (2) - 11 freq gather (2) - 18 freq |
daither (0) - 1 freq dither (1) - 2 freq gaither (2) - 83 freq naither (2) - 63 freq dother (2) - 37 freq dithery (2) - 1 freq raither (2) - 273 freq taither (2) - 1 freq maither (2) - 1 freq aither (2) - 141 freq laither (2) - 2 freq baither (2) - 2 freq faither (2) - 1391 freq lather (3) - 1 freq waether (3) - 3 freq bither (3) - 12 freq aether (3) - 1 freq neither (3) - 169 freq 'ither (3) - 7 freq faithir (3) - 1 freq alther (3) - 1 freq wather (3) - 75 freq igither (3) - 12 freq ither (3) - 3074 freq waithur (3) - 1 freq |
SoundEx code - D360 dother - 37 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 - 37 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.205883 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.342106 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.027116 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.037714 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.000875 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. |