| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eitches (0) - 1 freq bitches (1) - 6 freq witches (1) - 35 freq ditches (1) - 8 freq leitches (1) - 1 freq hitches (1) - 2 freq pitches (1) - 14 freq snitches (2) - 2 freq kitchens (2) - 6 freq titched (2) - 2 freq fleitches (2) - 2 freq switches (2) - 7 freq pinches (2) - 2 freq airches (2) - 12 freq ditched (2) - 1 freq fetches (2) - 4 freq retches (2) - 1 freq watches (2) - 29 freq pitched (2) - 7 freq 'witches (2) - 1 freq eithe (2) - 1 freq eithest (2) - 1 freq finches (2) - 1 freq eichts (2) - 4 freq catches (2) - 31 freq |
eitches (0) - 1 freq pitches (2) - 14 freq leitches (2) - 1 freq hitches (2) - 2 freq witches (2) - 35 freq bitches (2) - 6 freq ditches (2) - 8 freq patches (3) - 20 freq ratches (3) - 1 freq latches (3) - 2 freq matches (3) - 41 freq paitches (3) - 1 freq tithes (3) - 2 freq notches (3) - 1 freq riches (3) - 23 freq itched (3) - 1 freq niches (3) - 1 freq hutches (3) - 1 freq touches (3) - 21 freq taiches (3) - 1 freq hatches (3) - 4 freq inches (3) - 97 freq eatched (3) - 1 freq etched (3) - 13 freq erches (3) - 1 freq |
SoundEx code - E322 edges - 30 freq eitches - 1 freq edgewise - 1 freq |
MetaPhone code - EXS echoes - 26 freq echaes - 2 freq echas - 4 freq eshes - 6 freq eitches - 1 freq echos - 2 freq |
EITCHES |
| Time to execute Levenshtein function - 0.221542 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.369489 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.029249 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.043487 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.000928 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. |