| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eldritch (0) - 35 freq eldrich (1) - 12 freq eidritch (1) - 1 freq eildritch (1) - 4 freq heidrich (3) - 2 freq heydrich (3) - 7 freq purritch (3) - 3 freq driech (3) - 13 freq eildtrich (3) - 1 freq endlich (3) - 1 freq ditch (3) - 24 freq parritch (3) - 66 freq edith (3) - 18 freq fleitch (3) - 2 freq enrich (3) - 4 freq scritch (3) - 1 freq ulrich (3) - 1 freq leitch (3) - 11 freq porritch (3) - 7 freq crutch (4) - 4 freq feirich (4) - 1 freq riach (4) - 5 freq stretch (4) - 29 freq clarity (4) - 13 freq eith (4) - 26 freq |
eldritch (0) - 35 freq eildritch (1) - 4 freq eldrich (2) - 12 freq eidritch (2) - 1 freq parritch (5) - 66 freq scritch (5) - 1 freq ditch (5) - 24 freq porritch (5) - 7 freq leitch (5) - 11 freq ulrich (5) - 1 freq heidrich (5) - 2 freq purritch (5) - 3 freq heydrich (5) - 7 freq eildtrich (5) - 1 freq driech (5) - 13 freq lurch (6) - 6 freq scratch (6) - 53 freq wretch (6) - 3 freq crotch (6) - 1 freq adreich (6) - 1 freq 'droich (6) - 1 freq scraitch (6) - 1 freq pirraitch (6) - 1 freq drench (6) - 1 freq approtch (6) - 2 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 - ELTRX eldritch - 35 freq eldrich - 12 freq eildritch - 4 freq |
ELDRITCH |
| Time to execute Levenshtein function - 0.201596 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.362956 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.027737 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.037884 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.000925 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. |