| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emptied (0) - 20 freq empties (1) - 6 freq empied (1) - 3 freq emptie (1) - 1 freq emptiet (1) - 1 freq empie (2) - 25 freq empien (2) - 1 freq temptised (2) - 1 freq emitted (2) - 2 freq emptit (2) - 1 freq tempted (2) - 23 freq implied (2) - 2 freq hempie (3) - 2 freq emptyin (3) - 6 freq elted (3) - 1 freq enticed (3) - 2 freq tiptoed (3) - 2 freq ettie (3) - 4 freq whitied (3) - 1 freq imposed (3) - 9 freq motie (3) - 1 freq monied (3) - 3 freq emptiness (3) - 8 freq empty (3) - 213 freq copied (3) - 13 freq |
emptied (0) - 20 freq emptiet (2) - 1 freq emptie (2) - 1 freq empied (2) - 3 freq empties (2) - 6 freq emptit (3) - 1 freq tempted (3) - 23 freq emitted (3) - 2 freq implied (3) - 2 freq pitied (4) - 3 freq empty' (4) - 2 freq matted (4) - 2 freq erupted (4) - 8 freq muted (4) - 8 freq peetied (4) - 3 freq mited (4) - 1 freq umpteen (4) - 15 freq meted (4) - 2 freq ympteen (4) - 1 freq tiptaed (4) - 3 freq employed (4) - 8 freq maitied (4) - 1 freq opted (4) - 5 freq impaired (4) - 2 freq impaled (4) - 4 freq |
SoundEx code - E513 empty - 213 freq embdy - 15 freq empied - 3 freq emptyin - 6 freq empathy - 8 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 - EMPTT emptied - 20 freq emptiet - 1 freq emptit - 1 freq |
EMPTIED |
| Time to execute Levenshtein function - 0.186749 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.417474 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.027315 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.037282 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. |