| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalgleish (0) - 1 freq dalglish (1) - 4 freq dalkeith (3) - 17 freq dangles (3) - 1 freq anglish (3) - 1 freq angleesh (3) - 7 freq ragglish (3) - 3 freq dimoleish (3) - 1 freq panglish (3) - 1 freq langish (4) - 1 freq angles (4) - 29 freq fleish (4) - 3 freq deeilish (4) - 1 freq villish (4) - 1 freq gargles (4) - 1 freq sangless (4) - 2 freq halpless (4) - 1 freq valleys (4) - 3 freq kayleigh (4) - 2 freq demolish (4) - 2 freq callers (4) - 2 freq galilei (4) - 1 freq daeless (4) - 4 freq english (4) - 1469 freq deish (4) - 6 freq |
dalgleish (0) - 1 freq dalglish (1) - 4 freq ragglish (5) - 3 freq angleesh (5) - 7 freq panglish (5) - 1 freq dimoleish (5) - 1 freq anglish (5) - 1 freq dangles (5) - 1 freq delish (6) - 2 freq bullish (6) - 1 freq engleesh (6) - 9 freq inglish (6) - 156 freq dallies (6) - 5 freq draigless (6) - 1 freq inglesh (6) - 3 freq in-gleesh (6) - 4 freq dallas (6) - 1 freq hellish (6) - 20 freq danglies (6) - 2 freq english (6) - 1469 freq gleesh (6) - 1 freq devilish (6) - 4 freq ingleesh (6) - 4 freq dalls (6) - 1 freq deeilish (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 |
DALGLEISH |
| Time to execute Levenshtein function - 0.211011 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.381760 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.027837 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.037254 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.000867 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. |