| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shooglin (0) - 17 freq shooglit (1) - 1 freq shooglie (1) - 32 freq shouglin (1) - 2 freq shoogiein (2) - 1 freq jooglin (2) - 10 freq shoogled (2) - 16 freq shooerin (2) - 2 freq sooklin (2) - 1 freq shoggin (2) - 2 freq shooin (2) - 1 freq soolin (2) - 2 freq shoogly (2) - 26 freq shouglit (2) - 1 freq googlin (2) - 7 freq shootin (2) - 43 freq cooglin (2) - 1 freq shovelin (2) - 2 freq shigglin (2) - 1 freq shorelin (2) - 2 freq shoogles (2) - 7 freq shoomin (2) - 1 freq scoolin (2) - 2 freq shooglt (2) - 1 freq shoorin (2) - 1 freq |
shooglin (0) - 17 freq shouglin (1) - 2 freq shooglit (2) - 1 freq shooglie (2) - 32 freq shovelin (3) - 2 freq shouglit (3) - 1 freq shigglin (3) - 1 freq shoogles (3) - 7 freq shoogle (3) - 24 freq shoogly (3) - 26 freq shorelin (3) - 2 freq shooglet (3) - 5 freq shoggin (3) - 2 freq shooglt (3) - 1 freq shoogled (3) - 16 freq shoogiein (3) - 1 freq shouglie (3) - 1 freq shoogilt (4) - 1 freq shullin (4) - 3 freq haiglin (4) - 3 freq shoreline (4) - 4 freq shoogult (4) - 2 freq singlin (4) - 1 freq sheilin (4) - 2 freq shougle (4) - 3 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 |
SHOOGLIN |
| Time to execute Levenshtein function - 0.233489 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.379037 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.028317 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.037975 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.000848 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. |