| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shauchlin (0) - 10 freq schauchlin (1) - 1 freq fauchlin (2) - 1 freq strauchlin (2) - 6 freq bauchlin (2) - 1 freq sauchin (2) - 1 freq wauchlin (2) - 1 freq pauchlin (2) - 17 freq mauchlin (2) - 13 freq shauchlt (2) - 1 freq trauchlin (2) - 13 freq sprauchlin (2) - 7 freq scrauchlin (2) - 1 freq shauchles (2) - 2 freq shauchled (2) - 13 freq shuchin (2) - 1 freq shauchle (2) - 6 freq hanchin (3) - 1 freq shuillin (3) - 1 freq mauchline (3) - 4 freq hauchled (3) - 1 freq spraachlin (3) - 1 freq hauchles (3) - 1 freq searchin (3) - 26 freq scrauchin (3) - 2 freq |
shauchlin (0) - 10 freq schauchlin (2) - 1 freq shauchles (3) - 2 freq shuchin (3) - 1 freq shauchle (3) - 6 freq shauchlt (3) - 1 freq shauchled (3) - 13 freq strauchlin (4) - 6 freq bauchlin (4) - 1 freq pauchlin (4) - 17 freq shachle (4) - 1 freq snochlin (4) - 1 freq fauchlin (4) - 1 freq shucklan (4) - 1 freq shauchelt (4) - 3 freq wauchlin (4) - 1 freq mauchlin (4) - 13 freq sauchin (4) - 1 freq trauchlin (4) - 13 freq sprauchlin (4) - 7 freq scrauchlin (4) - 1 freq sucklin (5) - 1 freq staucherin (5) - 2 freq huchin (5) - 1 freq shufflin (5) - 6 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 - XXLN shauchlin - 10 freq |
SHAUCHLIN |
| Time to execute Levenshtein function - 0.187930 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.366957 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.027299 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.037193 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.000906 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. |