Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
rollin (0) - 58 freq collin (1) - 2 freq hollin (1) - 1 freq trollin (1) - 1 freq rollan (1) - 2 freq rollon (1) - 1 freq rollen (1) - 2 freq rowlin (1) - 4 freq rolling (1) - 7 freq rollie (1) - 3 freq roullin (1) - 3 freq roulin (1) - 2 freq roilin (1) - 1 freq pollin (1) - 10 freq rellin (1) - 1 freq roslin (1) - 1 freq lollin (1) - 2 freq rollin' (1) - 1 freq rollit (1) - 1 freq dullin (2) - 2 freq rivlin (2) - 5 freq relyin (2) - 7 freq scrollin (2) - 6 freq roller (2) - 27 freq rawlin (2) - 1 freq |
rollin (0) - 58 freq roullin (1) - 3 freq rellin (1) - 1 freq rollon (1) - 1 freq rollen (1) - 2 freq rollan (1) - 2 freq roslin (2) - 1 freq rullion (2) - 3 freq rallyin (2) - 3 freq rollin' (2) - 1 freq pollin (2) - 10 freq rolleen (2) - 1 freq lollin (2) - 2 freq rollit (2) - 1 freq roilin (2) - 1 freq trollin (2) - 1 freq hollin (2) - 1 freq rowlin (2) - 4 freq collin (2) - 2 freq rolling (2) - 7 freq rollie (2) - 3 freq roulin (2) - 2 freq riflin (3) - 1 freq yorlin (3) - 12 freq rolls (3) - 94 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 |
ROLLIN |
Time to execute Levenshtein function - 0.174113 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.326641 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.027976 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.036756 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.000797 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. |