| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edewanttimisseet (0) - 1 freq identifiet (8) - 1 freq mean-time (9) - 1 freq detriment (9) - 3 freq sentiment (9) - 16 freq departmint (9) - 1 freq stewartfisher (9) - 4 freq meantime (9) - 29 freq defankelise (9) - 1 freq twantient (9) - 1 freq identified (9) - 16 freq wan-time (9) - 1 freq identitie (9) - 17 freq wattir-syde (9) - 2 freq ewangelist (9) - 1 freq downingstreet (9) - 1 freq eventimes (9) - 1 freq romanticise (9) - 1 freq legitimise (9) - 2 freq department (9) - 31 freq identifies (9) - 5 freq oaptimist (9) - 1 freq thetimesscot (9) - 6 freq spaghettiisshit (9) - 1 freq identifee (9) - 5 freq |
edewanttimisseet (0) - 1 freq identities (13) - 18 freq identifiet (13) - 1 freq dentist (13) - 46 freq donateaticket (14) - 1 freq identifeeit (14) - 2 freq fantasist (14) - 1 freq meantimes (14) - 1 freq eergantibamess (14) - 1 freq enthusiast (14) - 4 freq depairtment (14) - 64 freq twenty-first (14) - 3 freq dismisst (14) - 2 freq downstairs (14) - 2 freq intromission (14) - 3 freq dintist (14) - 3 freq twenty-minute (14) - 2 freq legitimiss (14) - 1 freq downmarket (14) - 3 freq wastminster (14) - 2 freq educationscot (14) - 33 freq twantiet (14) - 2 freq thetimesscot (14) - 6 freq recentmaist (14) - 1 freq oaptimist (14) - 1 freq |
SoundEx code - E353 eident - 47 freq eydent - 20 freq eydently - 22 freq eidently - 16 freq eton-eddicated - 1 freq etnty - 1 freq eetimtation - 2 freq eediomatic - 9 freq eydentlie - 17 freq ehdentiteh - 1 freq eidenthie - 1 freq eidentlie - 3 freq eydentrie - 1 freq eittand - 1 freq eidiomatic - 1 freq edentulous - 1 freq edewanttimisseet - 1 freq edindogcathome - 2 freq |
MetaPhone code - ETWNTMST edewanttimisseet - 1 freq |
EDEWANTTIMISSEET |
| Time to execute Levenshtein function - 0.242640 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.420026 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.029815 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.041561 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.000907 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. |