| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epty (0) - 1 freq ept (1) - 1 freq empty (1) - 213 freq emty (1) - 3 freq eppy (1) - 1 freq ect (2) - 25 freq erts (2) - 11 freq eeth (2) - 1 freq eltz (2) - 1 freq arty (2) - 1 freq pta (2) - 1 freq impty (2) - 14 freq ents (2) - 1 freq epuf (2) - 1 freq eita (2) - 1 freq entry (2) - 61 freq wept (2) - 7 freq weety (2) - 2 freq eqvy (2) - 1 freq sexty (2) - 1 freq eggy (2) - 1 freq lept (2) - 2 freq nept (2) - 1 freq erth (2) - 3 freq westy (2) - 6 freq |
epty (0) - 1 freq ept (1) - 1 freq peity (2) - 4 freq pety (2) - 2 freq opoty (2) - 1 freq upt (2) - 2 freq pt (2) - 5 freq pte (2) - 4 freq apt (2) - 45 freq paty (2) - 1 freq ptay (2) - 1 freq peety (2) - 90 freq peaty (2) - 4 freq pity (2) - 44 freq emty (2) - 3 freq eppy (2) - 1 freq opt (2) - 2 freq empty (2) - 213 freq pta (2) - 1 freq deputy (3) - 6 freq pita (3) - 2 freq pey (3) - 249 freq piety (3) - 3 freq egt (3) - 1 freq apy (3) - 1 freq |
SoundEx code - E130 evyte - 2 freq evade - 2 freq e-boat - 2 freq eft - 3 freq ebbit - 1 freq effete - 4 freq ev'dy - 1 freq evite - 12 freq eveit - 3 freq evdy - 7 freq ept - 1 freq ebbhid - 1 freq efty' - 1 freq epty - 1 freq |
MetaPhone code - EPT ept - 1 freq epty - 1 freq |
EPTY |
| Time to execute Levenshtein function - 0.302556 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.529147 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.033408 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.043949 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.000998 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. |