| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elvire (0) - 4 freq elkie (2) - 1 freq expire (2) - 2 freq evviry (2) - 1 freq elise (2) - 1 freq entire (2) - 32 freq envie (2) - 2 freq ewvir (2) - 1 freq evvir (2) - 5 freq ervine (2) - 1 freq claire (2) - 10 freq vire (2) - 2 freq eclaire (2) - 1 freq eviry (2) - 1 freq evir (2) - 4 freq lire (2) - 2 freq eire (2) - 3 freq cleire (2) - 1 freq evie (2) - 8 freq loire (2) - 8 freq elie (2) - 1 freq empire (2) - 82 freq elaine (2) - 12 freq elite (2) - 21 freq elide (2) - 1 freq |
elvire (0) - 4 freq vire (3) - 2 freq eviry (3) - 1 freq evir (3) - 4 freq elvis (3) - 11 freq lire (3) - 2 freq evvir (3) - 5 freq loire (3) - 8 freq evviry (3) - 1 freq ewvir (3) - 1 freq elyer (4) - 1 freq libre (4) - 1 freq everee (4) - 1 freq elven (4) - 1 freq elevate (4) - 2 freq livari (4) - 1 freq luviee (4) - 2 freq viry (4) - 9 freq lere (4) - 2 freq alive (4) - 160 freq oeuvre (4) - 1 freq eevory (4) - 2 freq luive (4) - 9 freq lare (4) - 7 freq revere (4) - 1 freq |
SoundEx code - E416 elaborate - 7 freq eelebrate - 1 freq elaboration - 4 freq elvire - 4 freq elvire's - 1 freq elaborates - 1 freq elframoagain - 1 freq ealibraries - 6 freq |
MetaPhone code - ELFR elvire - 4 freq |
ELVIRE |
| Time to execute Levenshtein function - 0.728640 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 - 1.090593 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.045212 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.106670 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.000863 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. |