| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elf (0) - 10 freq qlf (1) - 1 freq eif (1) - 46 freq elt (1) - 2 freq belf (1) - 3 freq els (1) - 11 freq ulf (1) - 4 freq elm (1) - 3 freq elr (1) - 1 freq elfs (1) - 1 freq pelf (1) - 6 freq elk (1) - 6 freq self (1) - 93 freq ely (1) - 1 freq eli (1) - 4 freq ef (1) - 14 freq etf (1) - 1 freq eff (1) - 13 freq ell (1) - 1 freq erf (1) - 2 freq hlf (1) - 2 freq elo (1) - 2 freq el (1) - 25 freq egf (1) - 1 freq elc (1) - 5 freq |
elf (0) - 10 freq ulf (1) - 4 freq alf (1) - 7 freq lf (1) - 5 freq eld (2) - 30 freq lyf (2) - 3 freq helf (2) - 2 freq el (2) - 25 freq olaf (2) - 292 freq egf (2) - 1 freq elc (2) - 5 freq leif (2) - 2 freq leaf (2) - 40 freq olif (2) - 1 freq lof (2) - 1 freq lef (2) - 7 freq laf (2) - 1 freq elo (2) - 2 freq ayelf (2) - 1 freq aalf (2) - 1 freq elw (2) - 1 freq elm (2) - 3 freq elr (2) - 1 freq elfs (2) - 1 freq hlf (2) - 2 freq |
SoundEx code - E410 elba - 15 freq elbow - 20 freq elbae - 12 freq elby - 2 freq elphe - 1 freq elf - 10 freq eelive - 1 freq elph - 1 freq elbba - 1 freq elabwu - 1 freq |
MetaPhone code - ELF elphe - 1 freq elf - 10 freq eelive - 1 freq elph - 1 freq |
ELF |
| Time to execute Levenshtein function - 0.220977 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.362628 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.028956 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.038219 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.000950 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. |