| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| soctal (0) - 1 freq social (1) - 320 freq sortae (2) - 18 freq sortan (2) - 1 freq foetal (2) - 3 freq vockal (2) - 1 freq sociatal (2) - 2 freq soshal (2) - 4 freq focal (2) - 1 freq societal (2) - 4 freq stal (2) - 4 freq lockal (2) - 1 freq sorta (2) - 4 freq total (2) - 96 freq vocal (2) - 9 freq local (2) - 410 freq portal (2) - 3 freq 'social (2) - 2 freq sottar (2) - 10 freq soutar (2) - 39 freq scaal (2) - 1 freq spital (2) - 1 freq postal (2) - 3 freq mortal (2) - 54 freq locyal (2) - 3 freq |
soctal (0) - 1 freq sociatal (2) - 2 freq social (2) - 320 freq societal (2) - 4 freq sactly (3) - 1 freq stal (3) - 4 freq scaal (3) - 1 freq spital (3) - 1 freq settil (4) - 1 freq staal (4) - 2 freq sct (4) - 1 freq scoul (4) - 2 freq scael (4) - 4 freq sattil (4) - 1 freq stale (4) - 14 freq scaly (4) - 13 freq schol (4) - 2 freq scale (4) - 54 freq recital (4) - 1 freq actual (4) - 105 freq scull (4) - 1 freq socitie (4) - 2 freq zctl (4) - 1 freq scota (4) - 2 freq sect (4) - 3 freq |
SoundEx code - S234 sichtless - 4 freq suicidal - 3 freq societal - 4 freq soctal - 1 freq sociatal - 2 freq sactly - 1 freq sighthill - 2 freq sakdlpg - 1 freq sightly - 1 freq |
MetaPhone code - SKTL squattle - 1 freq soctal - 1 freq scuttel - 4 freq skuttle - 3 freq scuttle - 2 freq sactly - 1 freq skiddle - 1 freq skodal - 1 freq skeetly - 1 freq zctl - 1 freq |
SOCTAL |
| Time to execute Levenshtein function - 0.231551 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.411124 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.031963 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.039699 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.000845 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. |