| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elation (0) - 3 freq relation (1) - 18 freq election (2) - 87 freq eatin (2) - 154 freq oration (2) - 1 freq relatin (2) - 9 freq relations (2) - 14 freq emotion (2) - 18 freq elision (2) - 2 freq relatioun (2) - 3 freq vexation (2) - 5 freq elevation (2) - 3 freq ration (2) - 4 freq eaton (2) - 1 freq clarion (2) - 1 freq edition (2) - 27 freq latin (2) - 92 freq eltin (2) - 1 freq platoon (2) - 5 freq nation (2) - 143 freq elatit (2) - 1 freq equation (2) - 5 freq station (2) - 139 freq negation (2) - 2 freq slatin (2) - 2 freq |
elation (0) - 3 freq latin (2) - 92 freq elton (2) - 2 freq lotion (2) - 4 freq eltin (2) - 1 freq relation (2) - 18 freq elatit (3) - 1 freq equation (3) - 5 freq relatin (3) - 9 freq platoon (3) - 5 freq slatin (3) - 2 freq ection (3) - 16 freq luton (3) - 2 freq deletion (3) - 1 freq election (3) - 87 freq laitin (3) - 19 freq latyn (3) - 1 freq nation (3) - 143 freq ration (3) - 4 freq elevation (3) - 3 freq eatin (3) - 154 freq oration (3) - 1 freq elision (3) - 2 freq edition (3) - 27 freq emotion (3) - 18 freq |
SoundEx code - E435 elation - 3 freq eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eildons - 1 freq eldon - 1 freq eldin - 3 freq |
MetaPhone code - ELXN elation - 3 freq elshin - 1 freq elision - 2 freq eleision - 1 freq |
ELATION |
| Time to execute Levenshtein function - 0.507651 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.793799 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.033331 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.068432 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.000889 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. |