| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| succeful (0) - 1 freq succesfu (2) - 1 freq successful (2) - 22 freq succubus (3) - 1 freq spiteful (3) - 2 freq succede (3) - 1 freq peaceful (3) - 22 freq scheul (3) - 1 freq succesfae (3) - 1 freq useful (3) - 24 freq successfu' (3) - 1 freq tuneful (3) - 1 freq funciful (3) - 1 freq success (3) - 97 freq forceful (3) - 2 freq shameful (3) - 4 freq succeed (3) - 12 freq succour (3) - 6 freq successfu (3) - 14 freq graceful (3) - 10 freq succeeds (3) - 1 freq succeeded (4) - 8 freq careful (4) - 43 freq spoonful (4) - 2 freq bucketfu (4) - 1 freq |
succeful (0) - 1 freq successful (4) - 22 freq succesfu (4) - 1 freq forceful (5) - 2 freq funciful (5) - 1 freq shameful (5) - 4 freq graceful (5) - 10 freq succeeds (5) - 1 freq succour (5) - 6 freq succeed (5) - 12 freq success (5) - 97 freq succede (5) - 1 freq spiteful (5) - 2 freq succubus (5) - 1 freq scheul (5) - 1 freq peaceful (5) - 22 freq useful (5) - 24 freq succesfae (5) - 1 freq scweel (6) - 6 freq scoul (6) - 2 freq scael (6) - 4 freq succumb (6) - 1 freq succeedin (6) - 2 freq succar (6) - 3 freq lauchful (6) - 2 freq |
SoundEx code - S214 sex-plus-violence - 1 freq sookable - 2 freq sociable - 7 freq sizeable - 4 freq succeful - 1 freq socio-political - 1 freq sojouhblk - 1 freq sookyflooer - 1 freq sosfleague - 1 freq |
MetaPhone code - SKSFL succeful - 1 freq |
SUCCEFUL |
| Time to execute Levenshtein function - 0.209657 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.385311 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.027965 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.039394 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.000982 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. |