| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| successfu (0) - 14 freq sucessfu (1) - 1 freq successful (1) - 21 freq succesfu (1) - 1 freq successsfu (1) - 1 freq success (2) - 96 freq successor (2) - 3 freq successfae (2) - 4 freq successes (2) - 6 freq succesfae (3) - 1 freq sucesso' (3) - 1 freq stressfu (3) - 4 freq successors (3) - 2 freq succession (3) - 9 freq unsuccessful (3) - 2 freq succeful (3) - 1 freq sucess (3) - 1 freq successfully (3) - 7 freq €˜successful (3) - 1 freq successive (3) - 4 freq succeedit (4) - 6 freq bucketfu (4) - 1 freq succede (4) - 1 freq supress (4) - 1 freq supressed (4) - 1 freq |
successfu (0) - 14 freq successsfu (2) - 1 freq succesfu (2) - 1 freq successfae (2) - 4 freq sucessfu (2) - 1 freq successful (2) - 21 freq successes (3) - 6 freq successor (3) - 3 freq success (3) - 96 freq succession (4) - 9 freq succesfae (4) - 1 freq successive (4) - 4 freq sucess (5) - 1 freq successfully (5) - 7 freq unsuccessfae (5) - 1 freq stressfu (5) - 4 freq unsuccessful (5) - 2 freq sucesso' (5) - 1 freq successors (5) - 2 freq succeeds (6) - 1 freq access (6) - 73 freq accessin (6) - 5 freq aiccessed (6) - 1 freq accessed (6) - 2 freq succeful (6) - 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 - SKSSF successfu - 14 freq successive - 4 freq succesfu - 1 freq successfae - 4 freq succesfae - 1 freq successsfu - 1 freq |
SUCCESSFU |
| Time to execute Levenshtein function - 0.290983 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.567435 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.027283 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.072235 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.000781 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. |