| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shortly (0) - 33 freq schortly (1) - 2 freq shoartly (1) - 2 freq ghostly (2) - 16 freq shirty (2) - 1 freq shorter (2) - 24 freq chortle (2) - 1 freq short (2) - 323 freq smartly (2) - 5 freq softly (2) - 12 freq sharply (2) - 7 freq coortly (2) - 4 freq sorely (2) - 2 freq shouty (2) - 2 freq shurly (2) - 16 freq hordly (2) - 1 freq stoutly (2) - 2 freq smertly (2) - 24 freq shottle (2) - 1 freq shortlie (2) - 1 freq shorts (2) - 42 freq shoogly (2) - 27 freq stootly (2) - 1 freq sporty (2) - 3 freq shurely (2) - 3 freq |
shortly (0) - 33 freq shoartly (1) - 2 freq shortlie (2) - 1 freq schortly (2) - 2 freq shottle (3) - 1 freq shurly (3) - 16 freq sherply (3) - 8 freq sharply (3) - 7 freq shurely (3) - 3 freq shorts (3) - 42 freq smertly (3) - 24 freq chortle (3) - 1 freq short (3) - 323 freq smartly (3) - 5 freq shirty (3) - 1 freq shorter (3) - 24 freq smirtle (4) - 3 freq sharple (4) - 1 freq shoarter (4) - 1 freq shoarts (4) - 3 freq hertily (4) - 2 freq shirley (4) - 9 freq shrilly (4) - 1 freq shurt (4) - 1 freq shoart (4) - 41 freq |
SoundEx code - S634 shortly - 33 freq short-leeved - 1 freq sweirt-like - 1 freq sky-hurtlin - 1 freq shortlisted - 1 freq shrewdly - 1 freq short-lived - 3 freq sort'll - 1 freq shoartly - 2 freq shortlie - 1 freq shirtlifter - 1 freq scorriedale - 1 freq shortlins - 1 freq scartlin - 1 freq schortly - 2 freq short-leetit - 1 freq scartled - 1 freq scrittlin - 1 freq shirt'll - 1 freq shirtll - 1 freq shortlist - 1 freq shortlists - 1 freq shortlistit - 1 freq shortleesa - 2 freq |
MetaPhone code - XRTL shortly - 33 freq shrewdly - 1 freq shoartly - 2 freq shortlie - 1 freq chortle - 1 freq chordal - 1 freq shirt'll - 1 freq shirtll - 1 freq |
SHORTLY |
| Time to execute Levenshtein function - 0.223153 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.511281 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.069891 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.089613 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.001066 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. |