Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sociatal (0) - 2 freq societal (1) - 4 freq soctal (2) - 1 freq social (2) - 324 freq socials (3) - 3 freq socrates (3) - 3 freq 'social (3) - 2 freq scata (3) - 2 freq spittal (3) - 1 freq smittal (3) - 6 freq scaal (3) - 1 freq sociable (3) - 7 freq spital (3) - 1 freq society (3) - 177 freq sciatic (3) - 1 freq recital (3) - 1 freq socitie (3) - 2 freq socially (3) - 17 freq societie (3) - 13 freq swcoastal (3) - 1 freq sonatas (3) - 2 freq society' (3) - 1 freq mintal (4) - 1 freq borstal (4) - 1 freq sattl (4) - 1 freq |
sociatal (0) - 2 freq societal (1) - 4 freq soctal (2) - 1 freq social (3) - 324 freq recital (4) - 1 freq society (4) - 177 freq socitie (4) - 2 freq society' (4) - 1 freq spital (4) - 1 freq societie (4) - 13 freq socially (4) - 17 freq sciatic (4) - 1 freq sociable (4) - 7 freq scata (4) - 2 freq scaal (4) - 1 freq speitel (5) - 1 freq staal (5) - 2 freq scuttel (5) - 4 freq suicidal (5) - 3 freq scala (5) - 1 freq scoats (5) - 1 freq scael (5) - 4 freq sactly (5) - 1 freq scaaly (5) - 1 freq sectoral (5) - 7 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 - SXTL schedule - 17 freq schdl - 1 freq sociatal - 2 freq |
SOCIATAL |
Time to execute Levenshtein function - 0.204423 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.368753 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.028110 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.042529 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.004575 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. |