| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suicidal (0) - 3 freq suicide (2) - 10 freq quizical (3) - 1 freq buirial (3) - 4 freq social (3) - 324 freq special (3) - 238 freq suitid (3) - 3 freq speicial (3) - 1 freq judicial (3) - 2 freq guidal (3) - 1 freq muisical (3) - 12 freq spaicial (3) - 9 freq surgical (3) - 5 freq survival (3) - 25 freq sundial (3) - 1 freq municipal (3) - 2 freq saicl (4) - 1 freq medicinal (4) - 1 freq suttil (4) - 1 freq judeicial (4) - 1 freq 'special (4) - 4 freq cubical (4) - 2 freq semifinal (4) - 2 freq cicadas (4) - 1 freq satirical (4) - 3 freq |
suicidal (0) - 3 freq suicide (3) - 10 freq sundial (4) - 1 freq social (4) - 324 freq saiddil (5) - 4 freq scda (5) - 2 freq schdl (5) - 1 freq sandal (5) - 1 freq skodal (5) - 1 freq soctal (5) - 1 freq sicily (5) - 5 freq societal (5) - 4 freq soocide (5) - 1 freq scandal (5) - 10 freq saidil (5) - 2 freq sociatal (5) - 2 freq scaal (5) - 1 freq speicial (5) - 1 freq spaicial (5) - 9 freq guidal (5) - 1 freq muisical (5) - 12 freq special (5) - 238 freq suitid (5) - 3 freq saicl (5) - 1 freq sociable (6) - 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 - SSTL suicidal - 3 freq societal - 4 freq |
SUICIDAL |
| Time to execute Levenshtein function - 0.288833 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.764918 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.039040 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.077632 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.001173 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. |