| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elvis (0) - 11 freq pelvis (1) - 2 freq ellis (1) - 3 freq elves (1) - 10 freq eemis (2) - 12 freq elms (2) - 1 freq elbas (2) - 9 freq ellie (2) - 7 freq lyis (2) - 1 freq blois (2) - 5 freq elie (2) - 1 freq wyvis (2) - 1 freq alwis (2) - 23 freq elyia (2) - 2 freq mavis (2) - 5 freq elic (2) - 2 freq elaiss (2) - 1 freq evi (2) - 1 freq eywis (2) - 1 freq kelvin (2) - 8 freq elks (2) - 2 freq eldin (2) - 3 freq elses (2) - 1 freq lis (2) - 1 freq ravis (2) - 1 freq |
elvis (0) - 11 freq elves (1) - 10 freq ellis (2) - 3 freq pelvis (2) - 2 freq elbies (3) - 1 freq lois (3) - 1 freq leaves (3) - 208 freq elivin (3) - 1 freq luvs (3) - 11 freq elven (3) - 1 freq elise (3) - 1 freq leis (3) - 1 freq els (3) - 11 freq eaves (3) - 2 freq elsie (3) - 62 freq elvire (3) - 4 freq invis (3) - 1 freq leives (3) - 3 freq laves (3) - 3 freq luves (3) - 16 freq lives (3) - 241 freq levies (3) - 1 freq loves (3) - 68 freq lovies (3) - 1 freq luis (3) - 4 freq |
SoundEx code - E412 elbas - 9 freq elbows - 8 freq elvis - 11 freq elbuck - 13 freq elbucks - 6 freq elves - 10 freq elbaes - 1 freq elbock-cheer - 1 freq elbies - 1 freq elbick - 3 freq elbicks - 1 freq elbuk - 1 freq elipse - 1 freq elevkit - 1 freq elapse - 1 freq elfs - 1 freq elevicrkb - 1 freq elvis - 1 freq eilaubqdvm - 1 freq |
MetaPhone code - ELFS elvis - 11 freq elves - 10 freq elfs - 1 freq elvis - 1 freq |
ELVIS |
| Time to execute Levenshtein function - 0.215990 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.352969 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.027487 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.038427 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.000943 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. |