| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dlclue (0) - 1 freq mcclue (2) - 2 freq clue (2) - 87 freq develue (3) - 1 freq illie (3) - 2 freq dvlce (3) - 1 freq cue (3) - 10 freq velue (3) - 17 freq clye (3) - 2 freq €˜blue (3) - 1 freq blue (3) - 567 freq 'value (3) - 1 freq clique (3) - 3 freq dictum (3) - 1 freq lyle (3) - 3 freq decore (3) - 1 freq doulie (3) - 2 freq declan (3) - 35 freq dule (3) - 37 freq doolie (3) - 3 freq ducale (3) - 1 freq declin (3) - 1 freq dlgye (3) - 1 freq blyue (3) - 1 freq exclude (3) - 4 freq |
dlclue (0) - 1 freq dolce (4) - 1 freq dll (4) - 4 freq ducale (4) - 1 freq docile (4) - 1 freq dollie (4) - 1 freq clue (4) - 87 freq mcclue (4) - 2 freq dallie (4) - 13 freq slolee (5) - 1 freq mlle (5) - 1 freq dailie (5) - 8 freq dice (5) - 13 freq alcove (5) - 4 freq dulie (5) - 1 freq clie (5) - 2 freq delude (5) - 1 freq dachle (5) - 1 freq decade (5) - 30 freq decode (5) - 2 freq uncle (5) - 275 freq dowlie (5) - 3 freq declir (5) - 1 freq allie (5) - 9 freq allye (5) - 1 freq |
SoundEx code - D424 daluege'll - 1 freq dowlesslie - 1 freq dalziel - 1 freq dialeck-level - 1 freq dalglish - 4 freq dalgleish - 1 freq dailygael - 2 freq dlclue - 1 freq |
MetaPhone code - TLKL dailygael - 2 freq dlclue - 1 freq |
DLCLUE |
| Time to execute Levenshtein function - 0.221170 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.382799 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.027991 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.037144 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.000944 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. |