| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eets (0) - 58 freq etts (1) - 2 freq weets (1) - 1 freq eels (1) - 11 freq feets (1) - 1 freq ects (1) - 4 freq eet's (1) - 58 freq sets (1) - 127 freq ehts (1) - 1 freq leets (1) - 18 freq beets (1) - 49 freq eess (1) - 1 freq eet (1) - 581 freq eers (1) - 9 freq lets (1) - 72 freq ee's (1) - 17 freq bets (1) - 8 freq reets (1) - 16 freq gets (1) - 424 freq ents (1) - 1 freq eats (1) - 29 freq jets (1) - 5 freq eens (1) - 131 freq vets (1) - 9 freq aets (1) - 11 freq |
eets (0) - 58 freq eats (1) - 29 freq aets (1) - 11 freq eits (1) - 1 freq teets (2) - 2 freq mets (2) - 1 freq oots (2) - 22 freq ees (2) - 87 freq meets (2) - 33 freq nets (2) - 46 freq pets (2) - 12 freq erts (2) - 11 freq etsy (2) - 1 freq neets (2) - 1 freq oats (2) - 36 freq its (2) - 3299 freq outs (2) - 1 freq ts (2) - 41 freq aats (2) - 10 freq ats (2) - 126 freq yeats (2) - 1 freq ots (2) - 2 freq tees (2) - 3 freq tes (2) - 2 freq yits (2) - 1 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 - ETS eats - 29 freq eh-it's - 1 freq aets - 11 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 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.282718 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.565254 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.027581 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.071742 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.000821 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. |