| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rosemill (0) - 1 freq rosehill (1) - 3 freq roadkill (3) - 1 freq rover'll (3) - 1 freq resemble (3) - 3 freq rogmull (3) - 1 freq ranegill (3) - 1 freq rop-will (3) - 1 freq yosemite (3) - 2 freq roswell (3) - 1 freq rope-will (3) - 2 freq sempill (3) - 3 freq oneill (3) - 2 freq robgill (3) - 1 freq ashmill (3) - 3 freq refill (3) - 3 freq rope'll (3) - 1 freq resemmle (3) - 2 freq rosehips (3) - 1 freq roamin (4) - 9 freq tossils (4) - 1 freq revile (4) - 3 freq joshhall (4) - 1 freq unsmell (4) - 1 freq truebill (4) - 2 freq |
rosemill (0) - 1 freq rosehill (2) - 3 freq rogmull (4) - 1 freq resemmle (4) - 2 freq resemble (4) - 3 freq roswell (4) - 1 freq russell (5) - 37 freq rope'll (5) - 1 freq erse'll (5) - 1 freq 'smell (5) - 2 freq smaill (5) - 1 freq refill (5) - 3 freq smell (5) - 271 freq small (5) - 75 freq unsmell (5) - 1 freq ranegill (5) - 1 freq sempill (5) - 3 freq ashmill (5) - 3 freq roadkill (5) - 1 freq robgill (5) - 1 freq smyll (5) - 2 freq resemblin (6) - 6 freq newmill (6) - 1 freq itsell (6) - 16 freq assembly (6) - 26 freq |
SoundEx code - R254 regional - 106 freq resemmle - 2 freq ragnhild - 1 freq regionally - 1 freq re-gional - 1 freq €˜regional - 1 freq €œregional - 1 freq rekinnlin - 1 freq ragnails - 1 freq rosemill - 1 freq regionaliesaetion - 1 freq regonalitie - 1 freq rgnl - 1 freq rogmull - 1 freq |
MetaPhone code - RSML resemmle - 2 freq resemble - 3 freq rosemill - 1 freq reassemble - 1 freq |
ROSEMILL |
| Time to execute Levenshtein function - 0.420027 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.796069 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.029994 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.074184 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.000896 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. |