| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emptie (0) - 1 freq empie (1) - 25 freq emptit (1) - 1 freq emptied (1) - 20 freq empties (1) - 6 freq emptiet (1) - 1 freq emotive (2) - 3 freq motie (2) - 1 freq empien (2) - 1 freq temptit (2) - 11 freq empty (2) - 213 freq amitie (2) - 5 freq temptin (2) - 11 freq ertie (2) - 12 freq empty' (2) - 2 freq kempie (2) - 1 freq empire (2) - 82 freq empied (2) - 3 freq numptie (2) - 9 freq semplie (2) - 2 freq emptyin (2) - 6 freq hempie (2) - 2 freq ettie (2) - 4 freq echtie (2) - 4 freq foutie (3) - 4 freq |
emptie (0) - 1 freq emptiet (2) - 1 freq empty (2) - 213 freq empties (2) - 6 freq emptied (2) - 20 freq emptit (2) - 1 freq empie (2) - 25 freq empire (3) - 82 freq numptie (3) - 9 freq impit (3) - 1 freq empty' (3) - 2 freq amputee (3) - 2 freq emptyin (3) - 6 freq empied (3) - 3 freq empien (3) - 1 freq impty (3) - 14 freq amitie (3) - 5 freq motie (3) - 1 freq mootie (4) - 16 freq ample (4) - 9 freq montie (4) - 1 freq mentie (4) - 2 freq mattie (4) - 8 freq uptae (4) - 22 freq hempt (4) - 1 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 - EMPT empty - 213 freq empied - 3 freq emptie - 1 freq empty' - 2 freq 'empty' - 1 freq |
EMPTIE |
| Time to execute Levenshtein function - 0.494685 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.655247 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.027994 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.076849 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.001009 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. |