| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eecmdqqi (0) - 1 freq decide (5) - 121 freq eemock (5) - 8 freq rcqq (5) - 1 freq eedjit (5) - 7 freq dqqc (5) - 1 freq ekxmduy (5) - 1 freq eesed (5) - 65 freq fermi (5) - 5 freq ewmqn (5) - 1 freq eeemages (5) - 1 freq eelids (5) - 2 freq recedin (5) - 4 freq seemd (5) - 4 freq gemini (5) - 2 freq nemd (5) - 1 freq decided (5) - 210 freq eendoun (5) - 2 freq ecbqv (5) - 1 freq tlcmq (5) - 1 freq prwudqii (5) - 1 freq dqi (5) - 1 freq edmkcq (5) - 1 freq lcxdi (5) - 1 freq eediot (5) - 5 freq |
eecmdqqi (0) - 1 freq czdq (7) - 1 freq ctdqb (7) - 1 freq dqq (7) - 1 freq cmq (7) - 1 freq cmaqem (7) - 1 freq camden (8) - 1 freq edmkcq (8) - 1 freq czdxi (8) - 1 freq dqi (8) - 1 freq emdy (8) - 4 freq egfdqt (8) - 1 freq cumd (8) - 1 freq oecd (8) - 1 freq cidni (8) - 1 freq eiumqn (8) - 1 freq ecudnae (8) - 1 freq mdduq (8) - 1 freq mohqiq (8) - 1 freq ecbqv (8) - 1 freq mdi (8) - 1 freq emaaq (8) - 1 freq heimdall (8) - 3 freq ewmqn (8) - 1 freq dqqc (8) - 1 freq |
SoundEx code - E253 ecountry - 1 freq essentially - 6 freq essential - 47 freq eccentrics - 1 freq eccentric - 2 freq ex-model - 1 freq ezentn - 1 freq eccent - 4 freq 'essential - 1 freq essentials - 3 freq exeunt - 4 freq ecantrip - 1 freq essentiallie - 1 freq ee-candy - 1 freq eiss-shintie - 1 freq €œessential - 1 freq essention - 1 freq exeemed - 1 freq eecmdqqi - 1 freq eoghand - 1 freq ex-meadow - 1 freq eqomtfhgto - 1 freq ekxmduy - 1 freq ekeinootmorehoursfaedaday - 1 freq |
MetaPhone code - EKMTK eecmdqqi - 1 freq |
EECMDQQI |
| Time to execute Levenshtein function - 0.216131 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.417049 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.028656 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.038683 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.000874 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. |