| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| etc (0) - 191 freq ecc (1) - 1 freq tc (1) - 3 freq ebc (1) - 1 freq etch (1) - 2 freq enc (1) - 1 freq stc (1) - 1 freq eec (1) - 2 freq itc (1) - 1 freq eth (1) - 8 freq efc (1) - 1 freq etec (1) - 1 freq jtc (1) - 1 freq etc' (1) - 3 freq elc (1) - 5 freq etg (1) - 1 freq etf (1) - 1 freq etr (1) - 1 freq ec (1) - 18 freq etl (1) - 1 freq gtc (1) - 1 freq ett (1) - 97 freq et (1) - 256 freq edr (2) - 1 freq ena (2) - 16 freq |
etc (0) - 191 freq itc (1) - 1 freq tc (1) - 3 freq etec (1) - 1 freq gtc (2) - 1 freq etr (2) - 1 freq etf (2) - 1 freq ett (2) - 97 freq ec (2) - 18 freq et (2) - 256 freq tac (2) - 22 freq toc (2) - 2 freq tic (2) - 12 freq tuc (2) - 1 freq etg (2) - 1 freq etl (2) - 1 freq ebc (2) - 1 freq stc (2) - 1 freq elc (2) - 5 freq etch (2) - 2 freq enc (2) - 1 freq eec (2) - 2 freq ecc (2) - 1 freq etc' (2) - 3 freq jtc (2) - 1 freq |
SoundEx code - E320 edge - 190 freq eats - 30 freq etec - 1 freq eh-it's - 1 freq etc - 191 freq eattocks - 1 freq edgy - 7 freq eit's - 29 freq et's - 8 freq eits - 1 freq etse - 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 - ETK etec - 1 freq etc - 191 freq edick - 1 freq etc' - 3 freq eidduc - 1 freq edg - 1 freq etg - 1 freq |
ETC |
| Time to execute Levenshtein function - 0.180967 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.326341 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.027864 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.037192 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.000897 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. |