| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| secession (0) - 1 freq recession (1) - 3 freq session (2) - 81 freq deceision (2) - 5 freq deceesion (2) - 13 freq succession (2) - 9 freq sesssion (2) - 1 freq obsession (3) - 10 freq decessit (3) - 1 freq section (3) - 76 freq dereision (3) - 2 freq depression (3) - 27 freq concession (3) - 2 freq sessions (3) - 22 freq secretion (3) - 1 freq percussion (3) - 2 freq stressin (3) - 3 freq meesion (3) - 1 freq deceisions (3) - 2 freq selection (3) - 28 freq necessity (3) - 7 freq recessive (3) - 1 freq deveesion (3) - 1 freq decision (3) - 86 freq deceisioun (3) - 2 freq |
secession (0) - 1 freq recession (2) - 3 freq sesssion (3) - 1 freq succession (3) - 9 freq session (3) - 81 freq accessin (4) - 5 freq cessioun (4) - 1 freq occassion (4) - 1 freq sessione (4) - 2 freq sucesso' (4) - 1 freq deceision (4) - 5 freq deceesion (4) - 13 freq deceisioun (5) - 2 freq demission (5) - 2 freq cassin (5) - 4 freq inceesion (5) - 1 freq scansin (5) - 1 freq sucessfu (5) - 1 freq descussin (5) - 1 freq sassoon (5) - 1 freq decision (5) - 86 freq assessin (5) - 4 freq procession (5) - 33 freq discussion (5) - 50 freq secretion (5) - 1 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 - SSSN secession - 1 freq |
SECESSION |
| Time to execute Levenshtein function - 0.199326 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.364755 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.027241 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.039376 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.000858 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. |