| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| emotive (0) - 3 freq emptie (2) - 1 freq motives (2) - 4 freq emotion (2) - 18 freq erosive (2) - 1 freq motie (2) - 1 freq etive (2) - 1 freq motte (3) - 1 freq evasive (3) - 1 freq eelive (3) - 1 freq hematite (3) - 1 freq emojis (3) - 1 freq amitie (3) - 5 freq empties (3) - 6 freq negative (3) - 41 freq 'notice (3) - 1 freq fotie (3) - 5 freq demotic (3) - 5 freq emoji (3) - 3 freq emoticon (3) - 3 freq emoe (3) - 1 freq cootie (3) - 1 freq totve (3) - 1 freq move (3) - 307 freq muive (3) - 26 freq |
emotive (0) - 3 freq etive (3) - 1 freq motie (3) - 1 freq emotion (3) - 18 freq motives (3) - 4 freq totve (4) - 1 freq move (4) - 307 freq motion (4) - 45 freq muive (4) - 26 freq active (4) - 33 freq moave (4) - 1 freq motivate (4) - 2 freq mote (4) - 11 freq movie (4) - 15 freq mojave (4) - 1 freq mtv (4) - 2 freq motien (4) - 2 freq motir (4) - 12 freq mootie (4) - 16 freq moniave (4) - 3 freq motte (4) - 1 freq erosive (4) - 1 freq emptie (4) - 1 freq native (4) - 93 freq mottae (4) - 1 freq |
SoundEx code - E531 endeavour - 11 freq endeavours - 2 freq endeavour's - 1 freq endeavoured - 2 freq end-up - 5 freq endup - 1 freq entablatures - 1 freq emotive - 3 freq endeavouring - 1 freq endeavourt - 1 freq emotifinally - 1 freq endeavor - 1 freq eneedtibreakswet - 1 freq |
MetaPhone code - EMTF emotive - 3 freq |
EMOTIVE |
| Time to execute Levenshtein function - 0.215177 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.360383 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.030870 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.041980 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.001085 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. |