| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shouler-lenth (0) - 1 freq shouder-feather (5) - 1 freq shooderbeens (6) - 1 freq therteenth (6) - 1 freq shouler (6) - 9 freq knee-lenth (6) - 1 freq shouldnt (6) - 1 freq flouer-lit (6) - 1 freq shoulers (6) - 6 freq full-length (6) - 2 freq soul-less (6) - 1 freq vowel-length (6) - 1 freq shouteen (6) - 1 freq fu-lenth (6) - 1 freq fourteenth (6) - 6 freq fowerteenth (6) - 2 freq full-linth (6) - 1 freq houletgless (6) - 8 freq shore-line (6) - 1 freq tholeable (7) - 1 freq tolerant (7) - 1 freq hollered (7) - 5 freq gouvernament (7) - 3 freq serpents (7) - 18 freq shoulders (7) - 26 freq |
shouler-lenth (0) - 1 freq full-linth (9) - 1 freq shore-line (9) - 1 freq shouder-feather (9) - 1 freq three-month (10) - 1 freq fu-lenth (10) - 1 freq vowel-length (10) - 1 freq full-length (10) - 2 freq shouldnt (10) - 1 freq therteenth (10) - 1 freq flouer-lit (10) - 1 freq knee-lenth (10) - 1 freq shore-win (11) - 1 freq fill-length (11) - 1 freq hell-bent (11) - 2 freq shell-smuith (11) - 1 freq shibboleth (11) - 4 freq short-leetit (11) - 1 freq sailor-men (11) - 1 freq strenth (11) - 41 freq shrieketh (11) - 1 freq siller-mounted (11) - 1 freq shortlins (11) - 1 freq shullin (11) - 3 freq threteenth (11) - 1 freq |
SoundEx code - S464 shouler-lenth - 1 freq scholarlie - 3 freq scholarly - 5 freq siller'll - 1 freq |
MetaPhone code - XLRLN0 shouler-lenth - 1 freq |
SHOULER-LENTH |
| Time to execute Levenshtein function - 0.187064 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.358654 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.027853 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.037360 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.000892 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. |