| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suesuezep (0) - 1 freq shee-eep (4) - 1 freq susteen (4) - 1 freq squeeze (4) - 55 freq squeezes (4) - 3 freq sleeze (4) - 1 freq sneezed (4) - 10 freq naesleep (4) - 1 freq sneezes (4) - 15 freq squeezed (4) - 27 freq sneeze (4) - 24 freq sunsheen (4) - 6 freq seener (5) - 14 freq wheezed (5) - 3 freq seekened (5) - 1 freq steughed (5) - 1 freq meesure (5) - 2 freq suree (5) - 1 freq severe (5) - 15 freq squeezy (5) - 1 freq suspek (5) - 2 freq sneestered (5) - 1 freq seeven (5) - 95 freq suspects (5) - 4 freq setee (5) - 1 freq |
suesuezep (0) - 1 freq naesleep (6) - 1 freq sneezes (6) - 15 freq squeezed (6) - 27 freq sneezed (6) - 10 freq sneeze (6) - 24 freq shee-eep (6) - 1 freq sleeze (6) - 1 freq susteen (6) - 1 freq squeeze (6) - 55 freq squeezes (6) - 3 freq sesame (7) - 2 freq seize (7) - 2 freq sundup (7) - 3 freq seaseek (7) - 1 freq sussie (7) - 1 freq susie (7) - 38 freq suez (7) - 13 freq sasuge (7) - 1 freq sheep (7) - 295 freq susie's (7) - 4 freq escaep (7) - 2 freq sidestep (7) - 1 freq upswep (7) - 1 freq squeezt (7) - 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 - SSSP suesuezep - 1 freq |
SUESUEZEP |
| Time to execute Levenshtein function - 0.233243 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.383493 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.027419 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.036852 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.000805 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. |