| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zither (0) - 6 freq nither (1) - 5 freq 'ither (1) - 7 freq lither (1) - 1 freq rither (1) - 6 freq either (1) - 458 freq ither (1) - 3074 freq mither (1) - 1378 freq tither (1) - 202 freq cither (1) - 1 freq aither (1) - 141 freq wither (1) - 143 freq hither (1) - 6 freq dither (1) - 2 freq gither (1) - 69 freq bither (1) - 12 freq fither (1) - 12 freq zimmer (2) - 3 freq fitter (2) - 5 freq lather (2) - 1 freq 'ther (2) - 1 freq ficher (2) - 4 freq firther (2) - 1 freq gether (2) - 42 freq fuither (2) - 6 freq |
zither (0) - 6 freq wither (2) - 143 freq aither (2) - 141 freq hither (2) - 6 freq bither (2) - 12 freq fither (2) - 12 freq cither (2) - 1 freq gither (2) - 69 freq dither (2) - 2 freq 'ither (2) - 7 freq nither (2) - 5 freq tither (2) - 202 freq rither (2) - 6 freq lither (2) - 1 freq mither (2) - 1378 freq either (2) - 458 freq ither (2) - 3074 freq esther (3) - 46 freq miuther (3) - 1 freq gather (3) - 18 freq ruther (3) - 3 freq other (3) - 579 freq tther (3) - 6 freq tithir (3) - 1 freq igither (3) - 12 freq |
SoundEx code - Z360 zither - 6 freq zadar - 4 freq zodr - 1 freq zkdr - 1 freq |
MetaPhone code - S0R cither - 1 freq sowther - 5 freq soother - 3 freq see-through - 3 freq zither - 6 freq souther - 1 freq |
ZITHER |
| Time to execute Levenshtein function - 0.337018 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.586730 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.075999 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.037267 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.000900 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. |