| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raiglar (0) - 15 freq raigler (1) - 4 freq raigiar (1) - 1 freq traivlar (2) - 3 freq reglar (2) - 39 freq irraiglar (2) - 4 freq ragnar (2) - 18 freq aigle (3) - 4 freq triplar (3) - 1 freq rizla (3) - 1 freq saiddlar (3) - 1 freq rigor (3) - 1 freq angler (3) - 1 freq taiglet (3) - 1 freq aigles (3) - 1 freq cigar (3) - 19 freq railed (3) - 2 freq vaila (3) - 6 freq ranger (3) - 8 freq trailer (3) - 13 freq rigeur (3) - 1 freq draiglty (3) - 1 freq rangle (3) - 2 freq raiblin (3) - 1 freq rails (3) - 15 freq |
raiglar (0) - 15 freq raigler (1) - 4 freq raigiar (2) - 1 freq reglar (2) - 39 freq regular (3) - 75 freq ragnar (3) - 18 freq irraiglar (3) - 4 freq regilar (3) - 1 freq rigger (4) - 2 freq glar (4) - 7 freq raeler (4) - 1 freq angular (4) - 1 freq aregular (4) - 1 freq rigeur (4) - 1 freq irreglar (4) - 7 freq burglar (4) - 3 freq regiar (4) - 1 freq rigor (4) - 1 freq angler (4) - 1 freq traivlar (4) - 3 freq regal (5) - 2 freq waelar (5) - 1 freq raiser (5) - 2 freq raggle (5) - 207 freq draiglt (5) - 1 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 |
RAIGLAR |
| Time to execute Levenshtein function - 0.183848 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.330917 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.029837 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.036674 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.000805 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. |