| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| railin (0) - 12 freq hailin (1) - 7 freq dailin (1) - 1 freq rawlin (1) - 1 freq rairin (1) - 22 freq raivlin (1) - 1 freq raidin (1) - 9 freq tailin (1) - 1 freq railins (1) - 22 freq pailin (1) - 8 freq rainin (1) - 41 freq failin (1) - 27 freq bailin (1) - 3 freq nailin (1) - 1 freq railing (1) - 6 freq mailin (1) - 3 freq ailin (1) - 2 freq wailin (1) - 11 freq rilin (1) - 2 freq raiblin (1) - 1 freq raikin (1) - 14 freq sailin (1) - 38 freq raisin (1) - 33 freq roilin (1) - 1 freq trailin (1) - 27 freq |
railin (0) - 12 freq roilin (1) - 1 freq rilin (1) - 2 freq ailin (2) - 2 freq raikin (2) - 14 freq wailin (2) - 11 freq raiblin (2) - 1 freq sailin (2) - 38 freq trailin (2) - 27 freq reelin (2) - 16 freq roulin (2) - 2 freq rulin (2) - 6 freq roilan (2) - 1 freq mailin (2) - 3 freq raisin (2) - 33 freq raidin (2) - 9 freq tailin (2) - 1 freq rawlin (2) - 1 freq raivlin (2) - 1 freq rairin (2) - 22 freq railing (2) - 6 freq hailin (2) - 7 freq railins (2) - 22 freq bailin (2) - 3 freq nailin (2) - 1 freq |
SoundEx code - R450 reelin - 16 freq rollin - 58 freq railin - 12 freq rallyin - 3 freq rullion - 3 freq reelan - 3 freq rawlin - 1 freq realm - 20 freq roilin - 1 freq rulin - 6 freq rollin' - 1 freq rollen - 2 freq rowlin - 4 freq roulin - 2 freq roilan - 1 freq rallyan - 2 freq rellin - 1 freq relyin - 7 freq relyan - 1 freq rollan - 2 freq rolleen - 1 freq roullin - 3 freq realme - 1 freq relayin - 1 freq rilin - 2 freq rollon - 1 freq |
MetaPhone code - RLN reelin - 16 freq rollin - 58 freq railin - 12 freq rullion - 3 freq reelan - 3 freq rawlin - 1 freq roilin - 1 freq rulin - 6 freq rollin' - 1 freq rollen - 2 freq rowlin - 4 freq roulin - 2 freq roilan - 1 freq rellin - 1 freq rollan - 2 freq rolleen - 1 freq roullin - 3 freq rilin - 2 freq rollon - 1 freq |
RAILIN |
| Time to execute Levenshtein function - 0.219205 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.381670 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.028780 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.037978 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.000890 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. |