| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eets (0) - 58 freq pets (1) - 12 freq feets (1) - 1 freq eet's (1) - 58 freq eeth (1) - 1 freq meets (1) - 35 freq etts (1) - 2 freq weets (1) - 1 freq jets (1) - 5 freq sets (1) - 130 freq beets (1) - 49 freq nets (1) - 46 freq ehts (1) - 1 freq ents (1) - 1 freq vets (1) - 9 freq eits (1) - 1 freq eats (1) - 30 freq leets (1) - 18 freq ees (1) - 87 freq reets (1) - 16 freq bets (1) - 8 freq gets (1) - 432 freq teets (1) - 2 freq eens (1) - 131 freq eet (1) - 581 freq |
eets (0) - 58 freq aets (1) - 11 freq eits (1) - 1 freq eats (1) - 30 freq its (2) - 3335 freq lets (2) - 74 freq etsy (2) - 1 freq neets (2) - 1 freq eels (2) - 11 freq eers (2) - 9 freq erts (2) - 11 freq mets (2) - 1 freq eess (2) - 1 freq outs (2) - 1 freq yits (2) - 1 freq ots (2) - 2 freq teas (2) - 3 freq aits (2) - 21 freq tes (2) - 2 freq oats (2) - 37 freq ts (2) - 44 freq ats (2) - 126 freq tees (2) - 3 freq oots (2) - 23 freq yeats (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 - ETS eats - 30 freq eh-it's - 1 freq aets - 11 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 etts - 2 freq aedie's - 2 freq aedies - 1 freq eddies - 1 freq eds - 9 freq ehts - 1 freq etoo's - 1 freq 'eats - 2 freq etsy - 1 freq eoeutzi - 1 freq |
EETS |
| Time to execute Levenshtein function - 0.185644 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.350949 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.027442 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.036673 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.000921 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. |