| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shucklan (0) - 1 freq chucklan (1) - 1 freq sucklin (2) - 1 freq chucklin (2) - 3 freq hucklin (2) - 2 freq shackan (2) - 1 freq shockan (2) - 1 freq chuckan (2) - 1 freq skinklan (3) - 3 freq shuttan (3) - 3 freq shackles (3) - 6 freq shauchlin (3) - 10 freq chuckles (3) - 5 freq stickan (3) - 4 freq ehuckin (3) - 1 freq cacklan (3) - 1 freq stackan (3) - 2 freq shankland (3) - 3 freq suckled (3) - 3 freq huckled (3) - 12 freq chuckled (3) - 12 freq huckles (3) - 1 freq shakkan (3) - 3 freq hurlan (3) - 4 freq shufflin (3) - 6 freq |
shucklan (0) - 1 freq chucklan (2) - 1 freq shockan (3) - 1 freq hucklin (3) - 2 freq shackan (3) - 1 freq chucklin (3) - 3 freq sucklin (3) - 1 freq shackled (4) - 6 freq sheckle (4) - 1 freq shicken (4) - 2 freq shackin (4) - 1 freq shockeen (4) - 1 freq shackles (4) - 6 freq shackle (4) - 2 freq chuckan (4) - 1 freq shockin (4) - 19 freq hecklin (4) - 1 freq shauchlin (4) - 10 freq stuckken (5) - 1 freq souklin (5) - 1 freq shillan (5) - 1 freq shaetlan (5) - 284 freq chuckle (5) - 12 freq speckan (5) - 2 freq smockan (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 - XKLN shouglin - 2 freq shooglin - 17 freq chucklin - 3 freq chucklan - 1 freq shucklan - 1 freq shigglin - 1 freq |
SHUCKLAN |
| Time to execute Levenshtein function - 0.364858 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.406577 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.027893 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.041056 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.001190 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. |