| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| succession (0) - 9 freq successive (2) - 4 freq secession (2) - 1 freq successor (2) - 3 freq successfu (3) - 14 freq occassion (3) - 1 freq suppression (3) - 2 freq suspension (3) - 9 freq successfae (3) - 4 freq successful (3) - 21 freq procession (3) - 33 freq sucesso' (3) - 1 freq successsfu (3) - 1 freq recession (3) - 3 freq subversion (3) - 3 freq successes (3) - 6 freq concession (3) - 2 freq accessin (3) - 5 freq successors (3) - 2 freq succeedin (3) - 2 freq suggestion (3) - 25 freq submission (3) - 38 freq session (3) - 81 freq success (3) - 96 freq succesfu (4) - 1 freq |
succession (0) - 9 freq secession (3) - 1 freq successor (3) - 3 freq successive (3) - 4 freq accessin (4) - 5 freq success (4) - 96 freq successfae (4) - 4 freq successes (4) - 6 freq successfu (4) - 14 freq occassion (4) - 1 freq successors (5) - 2 freq submission (5) - 38 freq session (5) - 81 freq concession (5) - 2 freq succeedin (5) - 2 freq sucesso' (5) - 1 freq successful (5) - 21 freq successsfu (5) - 1 freq procession (5) - 33 freq recession (5) - 3 freq accressin (6) - 1 freq cessioun (6) - 1 freq occassions (6) - 1 freq sucess (6) - 1 freq occasion (6) - 42 freq |
SoundEx code - S225 succession - 9 freq secession - 1 freq sikhism - 2 freq shewcaasin - 1 freq sujjesjins - 1 freq sicecan - 1 freq socio-economics - 2 freq sexism - 3 freq showcasin - 1 freq scouseweegian - 4 freq socioeconomic - 1 freq sexism - 1 freq |
MetaPhone code - SKSSN succession - 9 freq |
SUCCESSION |
| Time to execute Levenshtein function - 0.195054 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.338377 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.027166 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.037986 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.001026 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. |