| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| empty (0) - 207 freq impty (1) - 14 freq epty (1) - 1 freq emty (1) - 3 freq empy (1) - 6 freq empty' (1) - 2 freq emery (2) - 1 freq embdy (2) - 14 freq tempt (2) - 8 freq dumpty (2) - 6 freq humpty (2) - 7 freq emit (2) - 4 freq emily (2) - 11 freq numpty (2) - 29 freq enmity (2) - 4 freq ept (2) - 1 freq temptt (2) - 1 freq emptit (2) - 1 freq emptie (2) - 1 freq etnty (2) - 1 freq kempy (2) - 2 freq emptyin (2) - 6 freq eppy (2) - 1 freq imply (2) - 2 freq employ (2) - 15 freq |
empty (0) - 207 freq impty (1) - 14 freq empy (2) - 6 freq emptie (2) - 1 freq empty' (2) - 2 freq epty (2) - 1 freq emty (2) - 3 freq imply (3) - 2 freq emptyin (3) - 6 freq emptit (3) - 1 freq employ (3) - 15 freq amity (3) - 2 freq impit (3) - 1 freq hempt (3) - 1 freq empie (3) - 25 freq empathy (3) - 7 freq mpy (3) - 1 freq numpty (3) - 29 freq ept (3) - 1 freq emit (3) - 4 freq dumpty (3) - 6 freq tempt (3) - 8 freq humpty (3) - 7 freq imps (4) - 3 freq mat (4) - 23 freq |
SoundEx code - E513 empty - 207 freq embdy - 14 freq empied - 3 freq emptyin - 6 freq empathy - 7 freq empties - 6 freq emptied - 20 freq embittert - 1 freq emptiness - 8 freq eenveytet - 1 freq embattled - 1 freq embedded - 4 freq embodies - 2 freq envied - 3 freq empathise - 4 freq embeddit - 4 freq emphatic - 4 freq emptyhaunded - 1 freq empty-handed - 1 freq embeddin' - 2 freq embed - 2 freq emptie - 1 freq empty' - 2 freq 'empty' - 1 freq embitter - 1 freq emptiet - 1 freq embodie - 1 freq embodiment - 2 freq empathetic - 2 freq enubdy - 1 freq embodyin - 1 freq €˜emptiness - 1 freq emphatically - 1 freq embodied - 2 freq embeddin - 1 freq emptit - 1 freq emptypocket - 1 freq |
MetaPhone code - EMPT empty - 207 freq empied - 3 freq emptie - 1 freq empty' - 2 freq 'empty' - 1 freq |
EMPTY |
| Time to execute Levenshtein function - 0.195432 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.327085 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.026982 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.036930 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.000805 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. |