| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emptyin (0) - 6 freq emittin (2) - 1 freq emptit (2) - 1 freq exptain (2) - 1 freq empty' (2) - 2 freq temptin (2) - 11 freq emptie (2) - 1 freq empty (2) - 213 freq implyin (2) - 3 freq eastlin (3) - 2 freq ettin (3) - 13 freq tempting (3) - 3 freq piyin (3) - 2 freq eyin (3) - 1 freq pryin (3) - 1 freq temptit (3) - 11 freq employing (3) - 1 freq eruptin (3) - 2 freq smithin (3) - 1 freq partyin (3) - 1 freq peetyin (3) - 2 freq ectin (3) - 1 freq editin (3) - 22 freq applyin (3) - 5 freq styin (3) - 4 freq |
emptyin (0) - 6 freq empty (3) - 213 freq umpteen (3) - 15 freq ympteen (3) - 1 freq emptie (3) - 1 freq implyin (3) - 3 freq temptin (3) - 11 freq exptain (3) - 1 freq emptit (3) - 1 freq empty' (3) - 2 freq emittin (3) - 1 freq emptiet (4) - 1 freq emotion (4) - 19 freq imponin (4) - 1 freq kempton (4) - 4 freq matin (4) - 5 freq imposin (4) - 4 freq impty (4) - 14 freq demption (4) - 1 freq mettin (4) - 2 freq imployin (4) - 1 freq emptied (4) - 20 freq peityin (4) - 1 freq implyan (4) - 1 freq captin (4) - 2 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 - EMPTYN emptyin - 6 freq |
EMPTYIN |
| Time to execute Levenshtein function - 0.198986 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.324591 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.027394 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.038089 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.000894 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. |