| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| regular (0) - 75 freq regulars (1) - 16 freq aregular (1) - 1 freq reglar (1) - 39 freq regilar (1) - 1 freq angular (2) - 1 freq regulate (2) - 3 freq secular (2) - 3 freq jugular (2) - 2 freq regiar (2) - 1 freq regularly (2) - 17 freq irregular (2) - 10 freq regulus (2) - 2 freq regale (3) - 2 freq fellar (3) - 1 freq sellar (3) - 15 freq relay (3) - 4 freq tubular (3) - 2 freq gulag (3) - 2 freq refull (3) - 1 freq reuls (3) - 2 freq result (3) - 116 freq retenar (3) - 1 freq reelan (3) - 3 freq regal (3) - 2 freq |
regular (0) - 75 freq reglar (1) - 39 freq regilar (1) - 1 freq aregular (1) - 1 freq regulars (2) - 16 freq irregular (3) - 10 freq regulus (3) - 2 freq raiglar (3) - 15 freq regiar (3) - 1 freq regularly (3) - 17 freq angular (3) - 1 freq regulate (3) - 3 freq jugular (3) - 2 freq irreglar (4) - 7 freq regalin (4) - 1 freq regaled (4) - 2 freq ruler (4) - 10 freq glar (4) - 7 freq raigler (4) - 4 freq ragnar (4) - 18 freq regal (4) - 2 freq regularlie (4) - 1 freq regalate (4) - 1 freq secular (4) - 3 freq regale (4) - 2 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 - RKLR raiglar - 15 freq regular - 75 freq reglar - 39 freq raigler - 4 freq |
REGULAR |
| Time to execute Levenshtein function - 0.450560 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.711581 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.029944 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.046272 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.001072 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. |