| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eldrich (0) - 12 freq eldritch (1) - 33 freq eildritch (2) - 4 freq eildtrich (2) - 1 freq enrich (2) - 4 freq ulrich (2) - 1 freq heidrich (2) - 2 freq endlich (2) - 1 freq eidritch (2) - 1 freq heydrich (2) - 7 freq leddrach (3) - 50 freq florish (3) - 1 freq rodrick (3) - 21 freq leich (3) - 1 freq droich (3) - 4 freq enrico (3) - 1 freq mold-rich (3) - 1 freq laroch (3) - 1 freq zurich (3) - 5 freq elrig (3) - 9 freq €œrich (3) - 1 freq edih (3) - 1 freq edith (3) - 18 freq erch (3) - 3 freq enric (3) - 1 freq |
eldrich (0) - 12 freq eldritch (2) - 33 freq heydrich (3) - 7 freq ulrich (3) - 1 freq heidrich (3) - 2 freq eildtrich (3) - 1 freq eildritch (3) - 4 freq laroch (4) - 1 freq lurch (4) - 6 freq huldrych (4) - 1 freq droich (4) - 4 freq larach (4) - 1 freq driech (4) - 13 freq leddrach (4) - 50 freq endlich (4) - 1 freq enrich (4) - 4 freq eidritch (4) - 1 freq dreich (4) - 158 freq 'droich (4) - 1 freq adreich (4) - 1 freq boorich (5) - 7 freq alricht (5) - 4 freq rich (5) - 189 freq lyric (5) - 6 freq fiddich (5) - 1 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 - ELTRX eldritch - 33 freq eldrich - 12 freq eildritch - 4 freq |
ELDRICH |
| Time to execute Levenshtein function - 0.198536 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.329836 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.027499 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.036714 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.000847 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. |