| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| regulars (0) - 16 freq regular (1) - 75 freq reglar (2) - 39 freq regularly (2) - 17 freq aregular (2) - 1 freq regulate (2) - 3 freq regilar (2) - 1 freq regulus (2) - 2 freq regulatit (3) - 2 freq angular (3) - 1 freq regularlie (3) - 1 freq regiar (3) - 1 freq rulers (3) - 8 freq results (3) - 71 freq regard (3) - 16 freq pedlars (3) - 1 freq regulaetors (3) - 1 freq regards (3) - 11 freq re-clart (3) - 1 freq redars (3) - 1 freq replays (3) - 1 freq beggars (3) - 8 freq rears (3) - 2 freq irregular (3) - 10 freq reealais (3) - 1 freq |
regulars (0) - 16 freq regular (2) - 75 freq regilar (3) - 1 freq regulus (3) - 2 freq aregular (3) - 1 freq reglar (3) - 39 freq regularly (3) - 17 freq reevlers (4) - 4 freq regulaetors (4) - 1 freq rulers (4) - 8 freq regularlie (4) - 1 freq regulate (4) - 3 freq uvulars (5) - 1 freq cellars (5) - 1 freq regalate (5) - 1 freq velars (5) - 1 freq burglars (5) - 2 freq jugular (5) - 2 freq reuls (5) - 2 freq rowlers (5) - 3 freq anglers (5) - 1 freq raiglar (5) - 15 freq rogers (5) - 6 freq ruggers (5) - 1 freq retailers (5) - 3 freq |
SoundEx code - R246 raiglar - 15 freq regular - 75 freq reeshle-reeshlin - 1 freq reglar - 39 freq regulars - 16 freq regilar - 1 freq regularly - 17 freq regularized - 1 freq regularlie - 1 freq re-clart - 1 freq raigler - 4 freq |
MetaPhone code - RKLRS regulars - 16 freq |
REGULARS |
| Time to execute Levenshtein function - 0.207016 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.386701 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.027782 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.043177 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.000988 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. |