| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scooshlin (0) - 1 freq scooshin (1) - 1 freq skooshin (2) - 8 freq cooshin (2) - 1 freq slooshin (2) - 2 freq scoolin (2) - 2 freq stooshie (3) - 67 freq smoothin (3) - 5 freq smoochin (3) - 1 freq coolin (3) - 2 freq scrollin (3) - 6 freq soolin (3) - 2 freq snochlin (3) - 1 freq pooshin (3) - 2 freq swooshin' (3) - 1 freq cooshion (3) - 1 freq cooglin (3) - 1 freq soochin (3) - 1 freq scoosh (3) - 6 freq kooshin (3) - 1 freq coushin (3) - 1 freq scorchin (3) - 5 freq scrovchlin (3) - 1 freq shooglin (3) - 17 freq scowlin (3) - 2 freq |
scooshlin (0) - 1 freq scooshin (2) - 1 freq scoolin (4) - 2 freq schoolin (4) - 4 freq slooshin (4) - 2 freq cooshin (4) - 1 freq skooshin (4) - 8 freq slooshan (5) - 1 freq cooshen (5) - 1 freq schulin (5) - 2 freq schuilin (5) - 6 freq scowlin (5) - 2 freq sloshin (5) - 3 freq cashline (5) - 1 freq slooshen (5) - 4 freq scoosh (5) - 6 freq scoolyin (5) - 1 freq cochlin (5) - 1 freq coushin (5) - 1 freq scrollin (5) - 6 freq snochlin (5) - 1 freq scushled (5) - 1 freq cooshion (5) - 1 freq soochin (5) - 1 freq hushlin (6) - 1 freq |
SoundEx code - S245 shouglin - 2 freq shooglin - 17 freq shauchlin - 10 freq squigglin' - 1 freq sizzling - 1 freq sizzlin - 5 freq sizzlen - 1 freq shoe-cleanin - 2 freq shucklan - 1 freq sociolinguisticultural - 1 freq sociolinguistic - 3 freq sociolinguists - 1 freq sucklin - 1 freq shigglin - 1 freq sooklin - 1 freq succulent - 1 freq socio-linguistics - 1 freq socio-linguists - 1 freq schauchlin - 1 freq sociolinguistics - 1 freq scooshlin - 1 freq souklin - 1 freq shooglemouse - 1 freq swiggling - 1 freq shooglenifty - 2 freq |
MetaPhone code - SKXLN scooshlin - 1 freq |
SCOOSHLIN |
| Time to execute Levenshtein function - 0.287923 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.425926 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.031639 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.042077 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.000804 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. |