Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
smyoll (0) - 1 freq smyll (1) - 2 freq smyril (2) - 1 freq swoll (2) - 1 freq styall (2) - 7 freq small (2) - 75 freq scroll (2) - 19 freq myll (2) - 2 freq smyl (2) - 1 freq smyle (2) - 2 freq smool (2) - 4 freq smell (2) - 271 freq stroll (2) - 21 freq smaill (2) - 1 freq say'll (2) - 1 freq smools (2) - 1 freq smoo (3) - 1 freq mell (3) - 23 freq scrolls (3) - 6 freq skool (3) - 3 freq soil (3) - 30 freq spyhole (3) - 1 freq smo (3) - 1 freq smog (3) - 5 freq smyl's (3) - 1 freq |
smyoll (0) - 1 freq smyll (1) - 2 freq smell (2) - 271 freq smaill (2) - 1 freq small (2) - 75 freq smool (3) - 4 freq say'll (3) - 1 freq smelly (3) - 32 freq smyle (3) - 2 freq smools (3) - 1 freq swoll (3) - 1 freq smyl (3) - 1 freq styall (3) - 7 freq smyril (3) - 1 freq myll (3) - 2 freq smelle (3) - 1 freq stell (4) - 31 freq some'll (4) - 1 freq sabill (4) - 1 freq squall (4) - 1 freq shall (4) - 123 freq smells (4) - 54 freq spill (4) - 24 freq swell (4) - 17 freq sill (4) - 19 freq |
SoundEx code - S540 smile - 458 freq snell - 81 freq smell - 271 freq snail - 33 freq 'senile - 1 freq samuel - 22 freq 'samuel - 3 freq smool - 4 freq smaill - 1 freq shammle - 1 freq 'smell - 2 freq smiley - 11 freq 'smile - 1 freq smuil - 1 freq small - 75 freq sun'll - 2 freq smellie - 1 freq smeyl - 1 freq smyle - 2 freq simile - 3 freq smelly - 32 freq sawmill - 9 freq some'll - 1 freq smelle - 1 freq sum'll - 1 freq shinnel - 2 freq shimley - 1 freq samuel' - 1 freq sammil - 1 freq somely - 1 freq smyll - 2 freq smæl - 1 freq smael - 3 freq 'semmelie - 1 freq semmelie - 8 freq smale - 1 freq smyl - 1 freq 'small' - 2 freq sawmiil - 1 freq somewhyle - 1 freq sinnle - 1 freq saw-mill - 1 freq snaile - 1 freq snellee - 1 freq shemale - 1 freq senile - 1 freq seemly - 1 freq snl - 2 freq synily - 1 freq sgoinneil - 1 freq smyoll - 1 freq sconnelly - 7 freq |
MetaPhone code - SMYL smyoll - 1 freq |
SMYOLL |
Time to execute Levenshtein function - 0.426265 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.645305 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.028834 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.038255 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.000914 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. |