| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalglish (0) - 4 freq dalgleish (1) - 1 freq anglish (2) - 1 freq ragglish (2) - 3 freq panglish (2) - 1 freq dallies (3) - 5 freq inglish (3) - 156 freq damish (3) - 4 freq tallis (3) - 1 freq devilish (3) - 4 freq dallas (3) - 1 freq english (3) - 1469 freq dallie (3) - 13 freq danglies (3) - 2 freq hallis (3) - 1 freq hellish (3) - 20 freq dangles (3) - 1 freq danish (3) - 19 freq daftish (3) - 2 freq villish (3) - 1 freq delish (3) - 2 freq langish (3) - 1 freq darkish (3) - 1 freq danglin (3) - 16 freq danglin' (3) - 1 freq |
dalglish (0) - 4 freq dalgleish (1) - 1 freq panglish (4) - 1 freq ragglish (4) - 3 freq anglish (4) - 1 freq dangles (5) - 1 freq demolish (5) - 2 freq hellish (5) - 20 freq delish (5) - 2 freq danglies (5) - 2 freq villish (5) - 1 freq dalls (5) - 1 freq dallas (5) - 1 freq inglish (5) - 156 freq dallies (5) - 5 freq deeilish (5) - 1 freq devilish (5) - 4 freq english (5) - 1469 freq bullish (5) - 1 freq dooglas (6) - 4 freq dolls (6) - 11 freq sluggish (6) - 3 freq douglass (6) - 4 freq daahenglish (6) - 2 freq ajenglish (6) - 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 - TLKLX dalglish - 4 freq dalgleish - 1 freq |
DALGLISH |
| Time to execute Levenshtein function - 0.300073 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.971087 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.095581 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.096942 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.000869 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. |