Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
societal (0) - 4 freq sociatal (1) - 2 freq society' (2) - 1 freq soctal (2) - 1 freq society (2) - 177 freq social (2) - 320 freq societie (2) - 13 freq skeletal (3) - 6 freq socials (3) - 3 freq socket (3) - 4 freq 'society' (3) - 1 freq soviet (3) - 7 freq secretar (3) - 29 freq sockets (3) - 8 freq socitie (3) - 2 freq recital (3) - 1 freq foetal (3) - 3 freq spittal (3) - 1 freq smittal (3) - 6 freq 'social (3) - 2 freq spital (3) - 1 freq societies (3) - 14 freq oriental (3) - 1 freq capietal (3) - 1 freq soshal (4) - 4 freq |
societal (0) - 4 freq sociatal (1) - 2 freq soctal (2) - 1 freq societie (3) - 13 freq social (3) - 320 freq society (3) - 177 freq society' (3) - 1 freq spital (4) - 1 freq societies (4) - 14 freq recital (4) - 1 freq socitie (4) - 2 freq scota (5) - 2 freq suicidal (5) - 3 freq ospital (5) - 8 freq scael (5) - 4 freq settl (5) - 1 freq scuttel (5) - 4 freq sciatic (5) - 1 freq scata (5) - 2 freq scaal (5) - 1 freq scweel (5) - 6 freq socially (5) - 15 freq scougal (5) - 1 freq scheul (5) - 1 freq speitel (5) - 1 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 - SSTL suicidal - 3 freq societal - 4 freq |
SOCIETAL |
Time to execute Levenshtein function - 0.174139 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.346450 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.027113 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.036954 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.000820 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. |