| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dilemma (0) - 10 freq dileema (1) - 1 freq cinema (3) - 8 freq diem (3) - 2 freq emma (3) - 42 freq fidelma (3) - 1 freq dileas (3) - 1 freq 'gemma (3) - 1 freq diploma (3) - 3 freq gemma (3) - 18 freq kinema (3) - 8 freq imma (3) - 1 freq ileum (3) - 1 freq wilma (3) - 3 freq ilumme (3) - 6 freq lemm (3) - 2 freq lemme (3) - 4 freq gleaman (4) - 1 freq demn (4) - 2 freq iberia (4) - 1 freq lammas (4) - 8 freq wireoa (4) - 1 freq ipma (4) - 1 freq wilhemina (4) - 1 freq lama (4) - 17 freq |
dilemma (0) - 10 freq dileema (2) - 1 freq ilumme (4) - 6 freq lemm (4) - 2 freq lemme (4) - 4 freq lamm (5) - 3 freq domm (5) - 1 freq dwammy (5) - 2 freq dulesum (5) - 1 freq dummy (5) - 27 freq dulesome (5) - 18 freq hlmm (5) - 1 freq dalaman (5) - 1 freq domme (5) - 1 freq dolmen (5) - 1 freq plummy (5) - 2 freq clammy (5) - 4 freq climm (5) - 5 freq limmy (5) - 2 freq 'gemma (5) - 1 freq diploma (5) - 3 freq gemma (5) - 18 freq dileas (5) - 1 freq fidelma (5) - 1 freq diem (5) - 2 freq |
SoundEx code - D450 dealin - 30 freq daelin - 6 freq dillion - 3 freq dylan - 13 freq dwallin - 15 freq dullin - 2 freq dileema - 1 freq delayin - 3 freq diallin - 4 freq dwellin - 4 freq dilemma - 10 freq dullion - 1 freq dial-an - 1 freq dolin - 1 freq dillan - 1 freq deelin - 1 freq dellin - 5 freq dalin - 4 freq delaney - 10 freq duellin - 2 freq dillon - 2 freq diallan - 1 freq dailin - 1 freq dlooney - 1 freq dalhanna - 1 freq dwlen - 1 freq |
MetaPhone code - TLM dileema - 1 freq dilemma - 10 freq taelem - 1 freq til'm - 2 freq talamh - 1 freq tellem - 1 freq |
DILEMMA |
| Time to execute Levenshtein function - 0.184289 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.414326 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.027346 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.042830 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.001094 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. |