| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalziel (0) - 1 freq dazzies (2) - 1 freq dallie (2) - 13 freq dallied (2) - 1 freq dallies (2) - 5 freq daniel (2) - 128 freq dale (3) - 29 freq daddie' (3) - 1 freq daisies (3) - 20 freq daill (3) - 1 freq dullies (3) - 2 freq dali (3) - 5 freq hanzel (3) - 1 freq rallies (3) - 7 freq daddie (3) - 3 freq dozie (3) - 5 freq dakkil (3) - 1 freq dailie (3) - 8 freq daniela (3) - 2 freq daled (3) - 5 freq daniels (3) - 1 freq baldie (3) - 23 freq malkie (3) - 12 freq dale' (3) - 1 freq allied (3) - 4 freq |
dalziel (0) - 1 freq dallie (3) - 13 freq daill (4) - 1 freq dalyell (4) - 6 freq dall (4) - 8 freq dollie (4) - 1 freq dazzies (4) - 1 freq dallied (4) - 1 freq dallies (4) - 5 freq daniel (4) - 128 freq deezie (5) - 1 freq dizzies (5) - 1 freq tulzies (5) - 1 freq dulie (5) - 1 freq dull (5) - 118 freq failzies (5) - 1 freq dail (5) - 7 freq dally (5) - 1 freq dillier (5) - 1 freq dizzie (5) - 2 freq dll (5) - 4 freq dales (5) - 6 freq dalai (5) - 2 freq dailies (5) - 1 freq callie (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 - TLSL dowlesslie - 1 freq dalziel - 1 freq |
DALZIEL |
| Time to execute Levenshtein function - 0.218521 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.394156 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.027599 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.043960 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.000932 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. |