| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rairin (0) - 22 freq railin (1) - 12 freq rairie (1) - 3 freq airin (1) - 4 freq 'rairin (1) - 1 freq raikin (1) - 14 freq fairin (1) - 13 freq rarin (1) - 5 freq raidin (1) - 9 freq lairin (1) - 2 freq hairin (1) - 3 freq rainin (1) - 40 freq sairin (1) - 3 freq raisin (1) - 32 freq wairin (1) - 1 freq cairtin (2) - 7 freq pairtin (2) - 19 freq daurin (2) - 10 freq draimin (2) - 1 freq daarin (2) - 1 freq airon (2) - 1 freq shirin (2) - 2 freq rakin (2) - 27 freq yairn (2) - 32 freq cairdin (2) - 2 freq |
rairin (0) - 22 freq rarin (1) - 5 freq sairin (2) - 3 freq raisin (2) - 32 freq wairin (2) - 1 freq earrin (2) - 1 freq rearin (2) - 8 freq roarin (2) - 60 freq hairin (2) - 3 freq rainin (2) - 40 freq lairin (2) - 2 freq rairie (2) - 3 freq railin (2) - 12 freq airin (2) - 4 freq 'rairin (2) - 1 freq raidin (2) - 9 freq fairin (2) - 13 freq raikin (2) - 14 freq farin (3) - 10 freq raison (3) - 51 freq ruinin (3) - 1 freq rair (3) - 30 freq rinin (3) - 2 freq ripin (3) - 3 freq ruitin (3) - 2 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.200578 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.367016 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.031711 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.036878 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.000882 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. |