| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eith (0) - 26 freq pith (1) - 9 freq kith (1) - 13 freq leith (1) - 200 freq eih (1) - 51 freq eithe (1) - 1 freq eirth (1) - 1 freq eits (1) - 1 freq fith (1) - 1 freq with (1) - 880 freq meith (1) - 3 freq keith (1) - 21 freq eit (1) - 644 freq nith (1) - 12 freq aith (1) - 23 freq beith (1) - 5 freq ith (1) - 2 freq dith (1) - 1 freq sith (1) - 6 freq deith (1) - 103 freq eth (1) - 8 freq mith (1) - 63 freq erth (1) - 3 freq eit' (1) - 2 freq lith (1) - 1 freq |
eith (0) - 26 freq aith (1) - 23 freq ith (1) - 2 freq eth (1) - 8 freq eithe (1) - 1 freq eeth (1) - 1 freq edith (2) - 18 freq oath (2) - 13 freq teith (2) - 5 freq pith (2) - 9 freq erth (2) - 3 freq eit' (2) - 2 freq eita (2) - 1 freq eirth (2) - 1 freq th (2) - 2479 freq ithe (2) - 14 freq eateh (2) - 1 freq tih (2) - 8 freq uth (2) - 1 freq yuith (2) - 1 freq mith (2) - 63 freq lith (2) - 1 freq keith (2) - 21 freq kith (2) - 13 freq eits (2) - 1 freq |
SoundEx code - E300 ett - 97 freq eat - 467 freq eat' - 6 freq et - 256 freq 'ee'd - 2 freq ee'd - 26 freq euid - 4 freq eddie - 31 freq eith - 26 freq eed - 11 freq eit - 644 freq eth - 8 freq eita - 1 freq ett' - 1 freq eit' - 2 freq eeyit - 1 freq eh'd - 2 freq eyed - 21 freq eddy - 2 freq 'eat - 6 freq eet - 581 freq 'eet' - 2 freq ed - 53 freq ead - 1 freq eateh - 1 freq eithe - 1 freq eeth - 1 freq 'eddie' - 1 freq edih - 1 freq eday - 5 freq eeday - 1 freq -ed - 1 freq edu - 3 freq e'd - 2 freq ed - 66 freq 'ett - 1 freq ettie - 4 freq Áed - 1 freq ed - 2 freq ead - 1 freq -eat - 1 freq eat - 2 freq eadie - 1 freq -ed - 1 freq eid - 4 freq eday - 1 freq e'day - 1 freq eahd - 1 freq eed - 1 freq eddyhow - 1 freq eddi - 1 freq eihd - 2 freq edi - 1 freq |
MetaPhone code - E0 eith - 26 freq eth - 8 freq eithe - 1 freq eeth - 1 freq |
EITH |
| Time to execute Levenshtein function - 0.174280 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.324964 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.027544 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.036862 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. |