| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etch (0) - 2 freq etc' (1) - 3 freq ech (1) - 5 freq ketch (1) - 9 freq betch (1) - 1 freq tch (1) - 3 freq eech (1) - 1 freq etcht (1) - 1 freq metch (1) - 1 freq etc (1) - 189 freq euch (1) - 1 freq retch (1) - 1 freq eth (1) - 8 freq each (1) - 622 freq fetch (1) - 62 freq erch (1) - 3 freq itch (1) - 5 freq eatch (1) - 1 freq hech (2) - 16 freq reech (2) - 6 freq teech (2) - 2 freq tich (2) - 2 freq perch (2) - 13 freq notch (2) - 6 freq ersh (2) - 1 freq |
etch (0) - 2 freq tch (1) - 3 freq eatch (1) - 1 freq itch (1) - 5 freq tich (2) - 2 freq teech (2) - 2 freq erch (2) - 3 freq tech (2) - 8 freq itchy (2) - 36 freq teach (2) - 84 freq yetoch (2) - 1 freq outch (2) - 1 freq fetch (2) - 62 freq teuch (2) - 31 freq eech (2) - 1 freq etcht (2) - 1 freq betch (2) - 1 freq each (2) - 622 freq etc' (2) - 3 freq ech (2) - 5 freq metch (2) - 1 freq ketch (2) - 9 freq eth (2) - 8 freq euch (2) - 1 freq etc (2) - 189 freq |
SoundEx code - E320 edge - 186 freq eats - 29 freq etec - 1 freq eh-it's - 1 freq etc - 189 freq eattocks - 1 freq edgy - 6 freq eit's - 29 freq et's - 8 freq eits - 1 freq eets - 58 freq eet's - 58 freq eat's - 1 freq eddie's - 3 freq edick - 1 freq etts - 2 freq eddies - 1 freq ethic - 1 freq eatch - 1 freq eds - 9 freq etch - 2 freq ethics - 3 freq etc' - 3 freq eidduc - 1 freq ethos - 2 freq €™edge - 1 freq etjwh - 1 freq ehts - 1 freq etxu - 1 freq etoo's - 1 freq edg - 1 freq 'eats - 2 freq ethgx - 1 freq edj - 1 freq etg - 1 freq etsy - 1 freq etjx - 1 freq eoeutzi - 1 freq |
MetaPhone code - EX each - 622 freq echo - 41 freq esh - 6 freq echa - 2 freq eechie - 8 freq echae - 1 freq euch - 1 freq eatch - 1 freq etch - 2 freq ech - 5 freq eech - 1 freq |
ETCH |
| Time to execute Levenshtein function - 0.208065 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.337260 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.032944 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.039704 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.000833 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. |