| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| razor (0) - 14 freq razer (1) - 1 freq razzor (1) - 2 freq razors (1) - 3 freq azor (1) - 4 freq raport (2) - 1 freq rarer (2) - 8 freq rzr (2) - 1 freq tabor (2) - 1 freq raver (2) - 4 freq major (2) - 108 freq racer (2) - 1 freq racord (2) - 2 freq orator (2) - 2 freq frazer (2) - 9 freq manor (2) - 4 freq calor (2) - 2 freq raynor (2) - 1 freq razored (2) - 1 freq mayor (2) - 3 freq rior (2) - 1 freq labor (2) - 1 freq rigor (2) - 1 freq nahor (2) - 3 freq raptor (2) - 1 freq |
razor (0) - 14 freq razer (1) - 1 freq rzr (2) - 1 freq azor (2) - 4 freq razzor (2) - 2 freq razors (2) - 3 freq grazer (3) - 1 freq nazir (3) - 1 freq mazr (3) - 1 freq rigor (3) - 1 freq raz (3) - 1 freq radar (3) - 11 freq razed (3) - 2 freq raker (3) - 2 freq rar (3) - 1 freq rawer (3) - 1 freq rior (3) - 1 freq azr (3) - 1 freq hazer (3) - 1 freq oranor (3) - 1 freq rair (3) - 30 freq raver (3) - 4 freq frazer (3) - 9 freq orator (3) - 2 freq racer (3) - 1 freq |
SoundEx code - R260 razer - 1 freq richer - 15 freq reassuir - 2 freq reassure - 12 freq razzor - 2 freq razor - 14 freq rugger - 2 freq rocker - 3 freq rosary - 5 freq rigger - 2 freq rocher - 5 freq require - 10 freq racer - 1 freq racherie - 1 freq rosario - 1 freq rougher - 1 freq roger - 5 freq rockery - 1 freq regiar - 1 freq rigor - 1 freq rasher - 1 freq roeckir - 1 freq rouchir - 1 freq raigiar - 1 freq roucher - 2 freq recur - 1 freq €œroger - 3 freq raiser - 2 freq rougier - 2 freq rosr - 1 freq rsyry - 1 freq rigeur - 1 freq raker - 2 freq reekiewar - 1 freq rzr - 1 freq |
MetaPhone code - RSR razer - 1 freq reassuir - 2 freq reassure - 12 freq razzor - 2 freq razor - 14 freq rosary - 5 freq racer - 1 freq rosario - 1 freq raiser - 2 freq rosr - 1 freq rsyry - 1 freq rzr - 1 freq |
RAZOR |
| Time to execute Levenshtein function - 0.184671 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.384678 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.028152 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.038329 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.000902 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. |