| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raigler (0) - 4 freq raiglar (1) - 15 freq raigiar (2) - 1 freq taigles (2) - 4 freq haigle (2) - 1 freq traivler (2) - 2 freq baigle (2) - 1 freq trailer (2) - 13 freq taigle (2) - 10 freq angler (2) - 1 freq rangles (2) - 1 freq rangle (2) - 2 freq aigle (2) - 4 freq raider (2) - 1 freq raither (2) - 273 freq dailer (2) - 1 freq aiger (2) - 2 freq aigles (2) - 1 freq raggle (2) - 207 freq railed (2) - 2 freq ranger (2) - 8 freq taigled (2) - 3 freq raeler (2) - 1 freq raiser (2) - 2 freq raige (2) - 1 freq |
raigler (0) - 4 freq raiglar (1) - 15 freq reglar (3) - 39 freq angler (3) - 1 freq raeler (3) - 1 freq rigger (3) - 2 freq raigiar (3) - 1 freq roger (4) - 5 freq regilar (4) - 1 freq ardler (4) - 1 freq vaiger (4) - 1 freq draigle (4) - 1 freq draigled (4) - 1 freq regular (4) - 75 freq rougier (4) - 2 freq ruler (4) - 10 freq rigeur (4) - 1 freq roller (4) - 27 freq rougher (4) - 1 freq rugger (4) - 2 freq rigor (4) - 1 freq irraiglar (4) - 4 freq airlier (4) - 16 freq retailer (4) - 1 freq rowler (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 |
RAIGLER |
| Time to execute Levenshtein function - 0.213631 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.402813 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.029113 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.039212 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.000812 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. |