| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elderly (0) - 14 freq eagerly (2) - 31 freq elders (2) - 21 freq tenderly (2) - 5 freq eldern (2) - 4 freq elder (2) - 58 freq elders' (2) - 1 freq orderly (2) - 4 freq everly (2) - 1 freq peerly (3) - 1 freq cleverly (3) - 3 freq clergy (3) - 2 freq derkly (3) - 1 freq celery (3) - 5 freq laetly (3) - 2 freq midderly (3) - 1 freq fleetly (3) - 1 freq derby (3) - 13 freq sleely (3) - 1 freq eader (3) - 1 freq older (3) - 26 freq anerly (3) - 7 freq deludedly (3) - 1 freq owerly (3) - 1 freq eely (3) - 2 freq |
elderly (0) - 14 freq orderly (3) - 4 freq elder (3) - 58 freq eldern (3) - 4 freq elders (3) - 21 freq eilder (4) - 1 freq faiderly (4) - 1 freq dearly (4) - 13 freq luverly (4) - 4 freq older (4) - 26 freq alder (4) - 1 freq tenderly (4) - 5 freq eagerly (4) - 31 freq elders' (4) - 1 freq everly (4) - 1 freq ainerly (5) - 2 freq derry (5) - 49 freq edder (5) - 21 freq miserly (5) - 1 freq 'derby (5) - 1 freq dourly (5) - 16 freq skeerly (5) - 1 freq l'derry (5) - 2 freq hinderly (5) - 1 freq ferly (5) - 20 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 - ELTRL elderly - 14 freq |
ELDERLY |
| Time to execute Levenshtein function - 0.310489 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.520638 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.058232 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.037080 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.000841 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. |