| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ehdentiteh (0) - 1 freq aidentitee (3) - 1 freq eydentrie (4) - 1 freq identity' (4) - 2 freq identitie (4) - 17 freq eidenthie (4) - 1 freq eidentlie (4) - 3 freq eventimes (4) - 1 freq dentie (4) - 6 freq identity (4) - 165 freq denties (4) - 2 freq dentit (4) - 3 freq e'entide (4) - 1 freq identifee (4) - 5 freq identities (4) - 18 freq eydentlie (4) - 17 freq eventide (4) - 2 freq deith (5) - 103 freq ventired (5) - 4 freq edeition (5) - 13 freq valentines (5) - 8 freq sentinel (5) - 5 freq cheenie (5) - 1 freq duntit (5) - 26 freq hertie (5) - 11 freq |
ehdentiteh (0) - 1 freq aidentitee (5) - 1 freq dunteth (6) - 1 freq dentit (6) - 3 freq identities (6) - 18 freq identity (6) - 165 freq identity' (6) - 2 freq eidenthie (6) - 1 freq identitie (6) - 17 freq identityis (7) - 1 freq duntit (7) - 26 freq dentition (7) - 1 freq twentieth (7) - 9 freq menteth (7) - 2 freq heitath (7) - 1 freq menteith (7) - 3 freq hauntit (7) - 15 freq denotit (7) - 1 freq hantit (7) - 3 freq seiventieth (7) - 1 freq huntit (7) - 29 freq identifee (7) - 5 freq haantit (7) - 1 freq denties (7) - 2 freq dentie (7) - 6 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 - ETNTT ehdentiteh - 1 freq |
EHDENTITEH |
| Time to execute Levenshtein function - 0.279200 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.511097 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.028704 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.069452 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.000867 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. |