| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elder (0) - 58 freq eilder (1) - 1 freq elmer (1) - 2 freq edder (1) - 21 freq felder (1) - 1 freq eider (1) - 3 freq alder (1) - 1 freq older (1) - 27 freq eldern (1) - 4 freq eader (1) - 1 freq elders (1) - 21 freq elyer (1) - 1 freq welder (1) - 4 freq melter (2) - 1 freq efer (2) - 1 freq efler (2) - 1 freq teller (2) - 2 freq efier (2) - 1 freq balder (2) - 1 freq keller (2) - 1 freq elr (2) - 1 freq bulder (2) - 4 freq eber (2) - 3 freq edr (2) - 1 freq ellar (2) - 1 freq |
elder (0) - 58 freq older (1) - 27 freq alder (1) - 1 freq eilder (1) - 1 freq welder (2) - 4 freq elyer (2) - 1 freq leader (2) - 59 freq aulder (2) - 245 freq leyder (2) - 1 freq aalder (2) - 24 freq elders (2) - 21 freq edder (2) - 21 freq felder (2) - 1 freq eader (2) - 1 freq eider (2) - 3 freq eldern (2) - 4 freq elmer (2) - 2 freq heeder (3) - 1 freq under (3) - 447 freq laer (3) - 1 freq neider (3) - 1 freq alter (3) - 15 freq slider (3) - 4 freq rider (3) - 10 freq gulder (3) - 24 freq |
SoundEx code - E436 elder - 58 freq eldern - 4 freq eldritch - 35 freq elders - 21 freq elder-flooer - 12 freq 'elders' - 2 freq elders' - 1 freq eldorado - 1 freq elderly - 14 freq eauldron - 1 freq eldrich - 12 freq eldérs - 1 freq eldèrs - 5 freq eilder - 1 freq eildritch - 4 freq eildtrich - 1 freq eildtrich-like - 1 freq elderberry - 10 freq eildrig - 2 freq |
MetaPhone code - ELTR elder - 58 freq eilder - 1 freq |
ELDER |
| Time to execute Levenshtein function - 0.223564 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.407584 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.030349 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.040522 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.000913 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. |