| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shakespeare (0) - 36 freq 'shakespeare (1) - 3 freq shakespeare' (1) - 3 freq shakespearean (2) - 3 freq shakespeare's (2) - 3 freq shakepseare (2) - 1 freq shakespearian (3) - 2 freq snakestane (4) - 1 freq sharper (5) - 1 freq despare (5) - 2 freq shaested (5) - 1 freq shaker (5) - 1 freq shakers (5) - 2 freq shakes (5) - 22 freq shopkeepers (5) - 1 freq shoapkepper (5) - 1 freq shoapkeeper (5) - 7 freq blazespage (5) - 22 freq hansper (5) - 1 freq shairper (5) - 2 freq shanesie (5) - 2 freq snakebake (5) - 2 freq shopkeeper (5) - 3 freq haes'nae (5) - 1 freq shoapkeepers (5) - 1 freq |
shakespeare (0) - 36 freq shakespeare' (2) - 3 freq 'shakespeare (2) - 3 freq shakespearean (3) - 3 freq shakepseare (4) - 1 freq shakespearian (4) - 2 freq shakespeare's (4) - 3 freq hansper (7) - 1 freq shoapkeeper (7) - 7 freq shairper (7) - 2 freq shopkeeper (7) - 3 freq sherper (7) - 2 freq shoapkepper (7) - 1 freq shakes (7) - 22 freq sharper (7) - 1 freq snakestane (7) - 1 freq shaker (7) - 1 freq sheenster (8) - 150 freq shampooer (8) - 1 freq skelpers (8) - 1 freq whisper (8) - 53 freq shaks (8) - 25 freq havester (8) - 1 freq shewster (8) - 2 freq shyster (8) - 1 freq |
SoundEx code - S221 successfu - 14 freq shakespeare - 36 freq 'shakespeare - 3 freq successive - 4 freq shakespeare's - 3 freq successful - 21 freq succesfu - 1 freq successfae - 4 freq succesfae - 1 freq shakespeare' - 3 freq shakespeare-owersettin - 1 freq shakespearean - 3 freq successfully - 7 freq successsfu - 1 freq sucessfu - 1 freq saxe-coburg-gotha - 1 freq €˜successful - 1 freq shakespearian - 2 freq scaceqpvwp - 1 freq swgoksxbzs - 1 freq suzyqfit - 1 freq suesuezep - 1 freq |
MetaPhone code - XKSPR shakespeare - 36 freq 'shakespeare - 3 freq shakespeare' - 3 freq |
SHAKESPEARE |
| Time to execute Levenshtein function - 0.218504 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.391257 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.029259 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.037739 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.000899 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. |