| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| squigglin' (1) - 1 freq squiggles (2) - 4 freq squiggled (2) - 1 freq squiggly (2) - 1 freq shigglin (2) - 1 freq smugglin (2) - 2 freq scuillin (3) - 3 freq strugglin (3) - 47 freq swiggling (3) - 1 freq scuilin (3) - 1 freq nigglin (3) - 3 freq swiggin (3) - 3 freq wrigglin (3) - 5 freq squirmin (3) - 3 freq squawlin (3) - 1 freq squattlin (3) - 1 freq squilein (3) - 1 freq swinglin (3) - 1 freq squintin (3) - 7 freq stugglin' (3) - 1 freq squirtin (3) - 4 freq squabblin (3) - 4 freq squeelin (3) - 2 freq draigglin (3) - 1 freq squealin (3) - 6 freq |
squigglin' (2) - 1 freq shigglin (3) - 1 freq squiggly (3) - 1 freq smugglin (3) - 2 freq squiggled (3) - 1 freq squiggles (3) - 4 freq stuggling (5) - 1 freq draigglin (5) - 1 freq squeelin (5) - 2 freq stragglin (5) - 1 freq squabblin (5) - 4 freq wigglin (5) - 5 freq squallin (5) - 1 freq singlin (5) - 1 freq stugglin' (5) - 1 freq jigglin (5) - 5 freq gigglin (5) - 13 freq squealin (5) - 6 freq wrigglin (5) - 5 freq swiggin (5) - 3 freq nigglin (5) - 3 freq swiggling (5) - 1 freq squawlin (5) - 1 freq strugglin (5) - 47 freq squilein (5) - 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 - SKKLN squigglin' - 1 freq |
SQUIGGLIN |
| Time to execute Levenshtein function - 0.205726 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.387493 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.027344 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.037109 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.000927 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. |