| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eydentlie (0) - 17 freq eidentlie (1) - 3 freq eydentrie (1) - 1 freq eidenthie (2) - 1 freq eydently (2) - 22 freq eydence (3) - 1 freq eidently (3) - 16 freq eydent (3) - 20 freq recentlie (3) - 2 freq gentlie (3) - 3 freq suddentlie (3) - 7 freq dentie (3) - 6 freq jyntlie (3) - 2 freq untentie (4) - 2 freq dewtie (4) - 8 freq sauntlie (4) - 1 freq twentie (4) - 1 freq identitie (4) - 17 freq lestlie (4) - 3 freq e'entide (4) - 1 freq deeplie (4) - 1 freq lenthie (4) - 1 freq sklentie (4) - 1 freq agentrie (4) - 3 freq heatlie (4) - 3 freq |
eydentlie (0) - 17 freq eidentlie (1) - 3 freq eydently (2) - 22 freq eydentrie (2) - 1 freq eidenthie (3) - 1 freq eidently (3) - 16 freq jyntlie (4) - 2 freq dently (4) - 1 freq gentlie (4) - 3 freq dentie (4) - 6 freq eydent (4) - 20 freq saintlie (5) - 1 freq tentilie (5) - 8 freq dentit (5) - 3 freq pyntle (5) - 1 freq dentily (5) - 1 freq jentle (5) - 2 freq ardently (5) - 1 freq sentle (5) - 1 freq gentle (5) - 81 freq evidently (5) - 25 freq identifie (5) - 1 freq denties (5) - 2 freq deintie (5) - 2 freq recentlie (5) - 2 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 - ETNTL eydently - 22 freq eidently - 16 freq eydentlie - 17 freq eidentlie - 3 freq |
EYDENTLIE |
| Time to execute Levenshtein function - 0.220014 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.366004 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.027715 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.037618 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.000933 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. |