| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enamoured (0) - 1 freq enamourt (2) - 1 freq smoured (3) - 4 freq endured (3) - 5 freq unmouped (3) - 1 freq flavoured (3) - 1 freq endeavoured (3) - 2 freq natured (3) - 2 freq enraptured (3) - 1 freq beglamoured (3) - 1 freq stumoured (3) - 1 freq armoured (3) - 1 freq airmoured (3) - 1 freq savoured (3) - 4 freq laboured (3) - 5 freq favoured (3) - 12 freq naptured (3) - 1 freq coloured (4) - 35 freq entombed (4) - 3 freq enjoyed (4) - 135 freq faured (4) - 3 freq erasure (4) - 1 freq smoored (4) - 32 freq kenmore (4) - 1 freq gnarred (4) - 1 freq |
enamoured (0) - 1 freq enamourt (3) - 1 freq natured (4) - 2 freq armoured (4) - 1 freq airmoured (4) - 1 freq unmouped (4) - 1 freq smoured (4) - 4 freq endured (4) - 5 freq entered (5) - 40 freq insured (5) - 3 freq smoored (5) - 32 freq anymore (5) - 14 freq smored (5) - 4 freq moored (5) - 2 freq enquired (5) - 9 freq numbered (5) - 6 freq injured (5) - 10 freq yammered (5) - 8 freq named (5) - 53 freq endeavoured (5) - 2 freq naitered (5) - 1 freq stumoured (5) - 1 freq savoured (5) - 4 freq laboured (5) - 5 freq naptured (5) - 1 freq |
SoundEx code - E556 enamourt - 1 freq enamoured - 1 freq eamonnreynolds - 87 freq |
MetaPhone code - ENMRT enamourt - 1 freq enamoured - 1 freq |
ENAMOURED |
| Time to execute Levenshtein function - 0.253677 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.590271 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.037968 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.092247 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.001058 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. |