| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rulin (0) - 6 freq rulit (1) - 2 freq bulin (1) - 1 freq ruin (1) - 36 freq pulin (1) - 1 freq rilin (1) - 2 freq yulin (1) - 1 freq ruein (1) - 3 freq fulin (1) - 2 freq rumlin (1) - 1 freq ruling (1) - 1 freq roulin (1) - 2 freq wuin (2) - 3 freq drumin (2) - 1 freq bruin (2) - 1 freq julie (2) - 29 freq wylin (2) - 2 freq grumlin (2) - 1 freq dublin (2) - 29 freq ruttin (2) - 1 freq nuhin (2) - 48 freq pu'in (2) - 8 freq buyin (2) - 84 freq dullin (2) - 2 freq rypin (2) - 5 freq |
rulin (0) - 6 freq roulin (1) - 2 freq rilin (1) - 2 freq ruling (2) - 1 freq relyin (2) - 7 freq railin (2) - 12 freq roilin (2) - 1 freq rumlin (2) - 1 freq reelin (2) - 16 freq ruin (2) - 36 freq fulin (2) - 2 freq bulin (2) - 1 freq rulit (2) - 2 freq pulin (2) - 1 freq yulin (2) - 1 freq ruein (2) - 3 freq rowin (3) - 30 freq runan (3) - 1 freq rowlin (3) - 4 freq resin (3) - 6 freq rapin (3) - 2 freq run (3) - 634 freq ailin (3) - 2 freq curlin (3) - 17 freq jylin (3) - 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 |
RULIN |
| Time to execute Levenshtein function - 0.224245 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.399263 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.029365 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.037675 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.000991 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. |