| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elder (0) - 58 freq eider (1) - 3 freq older (1) - 26 freq alder (1) - 1 freq eilder (1) - 1 freq elders (1) - 21 freq edder (1) - 21 freq eader (1) - 1 freq elyer (1) - 1 freq eldern (1) - 4 freq elmer (1) - 2 freq felder (1) - 1 freq welder (1) - 4 freq cler (2) - 1 freq holder (2) - 2 freq floer (2) - 2 freq bolder (2) - 1 freq euer (2) - 6 freq eldest (2) - 18 freq syder (2) - 5 freq endear (2) - 1 freq elves (2) - 10 freq feeder (2) - 5 freq ledder (2) - 23 freq nedder (2) - 18 freq |
elder (0) - 58 freq eilder (1) - 1 freq alder (1) - 1 freq older (1) - 26 freq aulder (2) - 243 freq welder (2) - 4 freq leyder (2) - 1 freq leader (2) - 58 freq felder (2) - 1 freq eider (2) - 3 freq elmer (2) - 2 freq aalder (2) - 24 freq edder (2) - 21 freq elders (2) - 21 freq elyer (2) - 1 freq eldern (2) - 4 freq eader (2) - 1 freq der (3) - 302 freq aider (3) - 2 freq looder (3) - 36 freq edr (3) - 1 freq slider (3) - 4 freq elderly (3) - 14 freq header (3) - 2 freq gulder (3) - 24 freq |
SoundEx code - E436 elder - 58 freq eldern - 4 freq eldritch - 33 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.200508 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.350514 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.027406 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.037487 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.000926 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. |