| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rairin (0) - 22 freq lairin (1) - 2 freq rairie (1) - 3 freq raikin (1) - 14 freq rainin (1) - 41 freq sairin (1) - 3 freq raisin (1) - 33 freq rarin (1) - 5 freq raidin (1) - 9 freq airin (1) - 4 freq railin (1) - 12 freq hairin (1) - 3 freq 'rairin (1) - 1 freq fairin (1) - 13 freq wairin (1) - 1 freq tairgin (2) - 1 freq kairn (2) - 1 freq mailin (2) - 3 freq raign (2) - 3 freq rappin (2) - 6 freq ruifin (2) - 2 freq thairin (2) - 1 freq rammin (2) - 3 freq rairt (2) - 1 freq saurin (2) - 1 freq |
rairin (0) - 22 freq rarin (1) - 5 freq 'rairin (2) - 1 freq fairin (2) - 13 freq wairin (2) - 1 freq roarin (2) - 60 freq rearin (2) - 8 freq earrin (2) - 1 freq railin (2) - 12 freq hairin (2) - 3 freq lairin (2) - 2 freq airin (2) - 4 freq rairie (2) - 3 freq raikin (2) - 14 freq rainin (2) - 41 freq raidin (2) - 9 freq raisin (2) - 33 freq sairin (2) - 3 freq yairn (3) - 32 freq gaarin (3) - 1 freq eairryin (3) - 1 freq ruinin (3) - 1 freq rearan (3) - 1 freq repairin (3) - 3 freq ripin (3) - 3 freq |
SoundEx code - R650 rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq rewirin - 1 freq rewirin' - 1 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
MetaPhone code - RRN rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
RAIRIN |
| Time to execute Levenshtein function - 0.291254 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.524949 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.027785 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.044942 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.000918 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. |