| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalserf (0) - 1 freq falsers (2) - 18 freq danser (2) - 1 freq balmer (3) - 2 freq daanert (3) - 1 freq daaner (3) - 1 freq halper (3) - 2 freq dosser (3) - 1 freq saasers (3) - 1 freq daled (3) - 5 freq talkers (3) - 1 freq darger (3) - 2 freq dafter (3) - 6 freq walters (3) - 4 freq walterw (3) - 1 freq faltert (3) - 1 freq dayset (3) - 5 freq dale (3) - 29 freq dalry (3) - 3 freq darker (3) - 9 freq daluege (3) - 1 freq aaler (3) - 17 freq yaiser (3) - 3 freq dulse (3) - 9 freq gallery (3) - 23 freq |
dalserf (0) - 1 freq falsers (4) - 18 freq danser (4) - 1 freq waldorf (5) - 2 freq deserr (5) - 1 freq denser (5) - 2 freq derf (5) - 2 freq dalyrd (5) - 1 freq dowser (5) - 1 freq desert (5) - 60 freq dealer (5) - 15 freq dailer (5) - 1 freq dealers (5) - 10 freq dales (5) - 6 freq lasers (5) - 2 freq dessert (5) - 4 freq duller (5) - 2 freq dolders (5) - 1 freq dossers (5) - 3 freq deleer (5) - 1 freq laser (5) - 4 freq dailers (5) - 2 freq dolder (5) - 1 freq desers (5) - 1 freq dalry (5) - 3 freq |
SoundEx code - D426 delcarin - 1 freq dalserf - 1 freq |
MetaPhone code - TLSRF dalserf - 1 freq |
DALSERF |
| Time to execute Levenshtein function - 0.260242 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.437022 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.032459 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.042101 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.000953 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. |