| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shortlisted (0) - 1 freq shortlist (2) - 1 freq shortlists (2) - 1 freq shortlistit (2) - 1 freq short-lived (3) - 3 freq shortlie (3) - 1 freq shirtlifter (3) - 1 freq porsisted (4) - 1 freq chortled (4) - 2 freq shortest (4) - 1 freq short-leeved (4) - 1 freq salisted (4) - 1 freq short-sichted (4) - 2 freq hoisted (4) - 3 freq shoreline (4) - 4 freq shortbreed (4) - 3 freq snortled (4) - 1 freq shortened (4) - 2 freq chorister (4) - 1 freq shortlins (4) - 1 freq ootlasted (4) - 1 freq sported (5) - 1 freq shorie (5) - 2 freq moralistic (5) - 1 freq houliston (5) - 2 freq |
shortlisted (0) - 1 freq shortlistit (3) - 1 freq shortlist (3) - 1 freq shortlists (3) - 1 freq shirtlifter (5) - 1 freq shortlie (6) - 1 freq short-lived (6) - 3 freq shortest (6) - 1 freq shortened (7) - 2 freq snortled (7) - 1 freq shortlins (7) - 1 freq shortleesa (7) - 2 freq shortbreed (7) - 3 freq shettleston (7) - 10 freq ootlasted (7) - 1 freq short-leeved (7) - 1 freq short-sichted (7) - 2 freq salisted (7) - 1 freq chortled (7) - 2 freq shortages (8) - 1 freq shorts (8) - 42 freq shorthaund (8) - 1 freq chortles (8) - 1 freq thrusted (8) - 1 freq shortcut (8) - 4 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 - XRTLSTT shortlisted - 1 freq shortlistit - 1 freq |
SHORTLISTED |
| Time to execute Levenshtein function - 0.273040 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.483822 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.029103 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.038588 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.000846 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. |