| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enamourt (0) - 1 freq enamoured (2) - 1 freq faavourt (3) - 1 freq atourt (3) - 1 freq glamourit (3) - 1 freq amour (3) - 1 freq lamour (3) - 1 freq clamour (3) - 8 freq favourt (3) - 5 freq endeavourt (3) - 1 freq l'amour (3) - 1 freq senatours (3) - 1 freq amount (3) - 50 freq famour (3) - 1 freq beglamourt (3) - 1 freq glamour (3) - 29 freq ennywurt (3) - 1 freq chamour (3) - 1 freq envious (4) - 2 freq rymour (4) - 1 freq labour' (4) - 1 freq nattur (4) - 1 freq fracturt (4) - 1 freq aroart (4) - 1 freq hensour (4) - 1 freq |
enamourt (0) - 1 freq enamoured (3) - 1 freq enquirt (5) - 1 freq yammert (5) - 1 freq nort (5) - 53 freq hameart (5) - 3 freq amrut (5) - 1 freq namit (5) - 4 freq nummert (5) - 4 freq engert (5) - 1 freq enmaist (5) - 1 freq injurt (5) - 1 freq naturet (5) - 1 freq smoort (5) - 8 freq en-route (5) - 1 freq anymore (5) - 14 freq mort (5) - 3 freq damart (5) - 1 freq unhurt (5) - 1 freq namer (5) - 1 freq favourt (5) - 5 freq endeavourt (5) - 1 freq amount (5) - 50 freq lamour (5) - 1 freq amour (5) - 1 freq |
SoundEx code - E556 enamourt - 1 freq enamoured - 1 freq eamonnreynolds - 87 freq |
MetaPhone code - ENMRT enamourt - 1 freq enamoured - 1 freq |
ENAMOURT |
| Time to execute Levenshtein function - 0.215757 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.395221 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.029724 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.038374 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.000995 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. |