| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sesspit (0) - 1 freq cesspit (1) - 2 freq seepit (2) - 4 freq fessit (2) - 2 freq serssit (2) - 2 freq sensit (2) - 1 freq steppit (3) - 41 freq seurrit (3) - 1 freq snappit (3) - 32 freq shappit (3) - 2 freq sess (3) - 3 freq fessin (3) - 1 freq resit (3) - 1 freq testit (3) - 10 freq stipit (3) - 7 freq sleepit (3) - 40 freq reestit (3) - 11 freq slopit (3) - 1 freq heystit (3) - 1 freq sensin (3) - 9 freq escapit (3) - 5 freq stumpit (3) - 2 freq slappit (3) - 2 freq soupit (3) - 4 freq lempit (3) - 2 freq |
sesspit (0) - 1 freq cesspit (2) - 2 freq susset (4) - 1 freq assessit (4) - 1 freq sensit (4) - 1 freq seepit (4) - 4 freq serssit (4) - 2 freq fessit (4) - 2 freq shaepit (5) - 2 freq soopit (5) - 3 freq slippit (5) - 69 freq rispit (5) - 1 freq skepit (5) - 1 freq sees't (5) - 1 freq stoupit (5) - 1 freq shirpit (5) - 2 freq stuppit (5) - 1 freq swypit (5) - 2 freq respite (5) - 4 freq snashit (5) - 1 freq assist (5) - 8 freq swampit (5) - 1 freq stoppit (5) - 100 freq sesse (5) - 1 freq respiyt (5) - 1 freq |
SoundEx code - S213 saggy-bawed - 1 freq six-fit - 2 freq sauch-patternt - 1 freq six-fit-four - 3 freq six-foot - 1 freq seeck-beds - 1 freq six-feet - 1 freq shoogie-boats - 1 freq suackbuts - 1 freq seik-bed - 1 freq sax-fit - 1 freq suspetioun - 1 freq suspeitioun - 1 freq susbtrate - 1 freq susceptible - 3 freq sesspit - 1 freq |
MetaPhone code - SSPT cesspit - 2 freq sesspit - 1 freq |
SESSPIT |
| Time to execute Levenshtein function - 0.203358 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.626031 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.030260 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.077255 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.001084 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. |