| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| scrammlit (0) - 1 freq scramblit (1) - 1 freq scrammlin (1) - 2 freq scrammlie (1) - 1 freq scramml't (1) - 1 freq scrammelt (2) - 2 freq scrammled (2) - 6 freq crummlit (2) - 1 freq scrammle (2) - 2 freq scrummlin (2) - 1 freq scramblin (2) - 4 freq scrammult (2) - 1 freq crammlin (2) - 1 freq strampit (3) - 2 freq scrartit (3) - 1 freq crummlie (3) - 1 freq scrambled (3) - 7 freq scrimpit (3) - 4 freq scailit (3) - 2 freq trimmlit (3) - 1 freq sprawlit (3) - 1 freq slammit (3) - 1 freq crummlin (3) - 8 freq srummlie (3) - 1 freq scrabblin (3) - 1 freq |
scrammlit (0) - 1 freq scrammelt (2) - 2 freq scramml't (2) - 1 freq scrammult (2) - 1 freq scramblit (2) - 1 freq scrammlie (2) - 1 freq scrammlin (2) - 2 freq scrummlin (3) - 1 freq crummlit (3) - 1 freq scrammle (3) - 2 freq scrammled (3) - 6 freq crammlin (4) - 1 freq scramblin (4) - 4 freq crammt (5) - 1 freq crumplit (5) - 1 freq scrammlers (5) - 1 freq screamit (5) - 2 freq scrammbled (5) - 1 freq crummelt (5) - 1 freq scrabblet (5) - 1 freq scramblan (5) - 1 freq tremmlit (5) - 1 freq scramble (5) - 6 freq srummlie (5) - 1 freq scrimpit (5) - 4 freq |
SoundEx code - S654 scrammled - 6 freq scrammlin - 2 freq scrummlin - 1 freq sornhill - 1 freq scrammelt - 2 freq scrammult - 1 freq scramml't - 1 freq serenely - 6 freq scrammlie - 1 freq shoormal - 9 freq 'shroomal' - 1 freq scrammlers - 1 freq shoormail - 1 freq shörmal - 4 freq scrammle - 2 freq sharnie-loss - 8 freq scrammlit - 1 freq sharon'll - 1 freq srummlie - 1 freq |
MetaPhone code - SKRMLT scrammled - 6 freq scrammbled - 1 freq scrammelt - 2 freq scrammult - 1 freq scramml't - 1 freq scramblit - 1 freq scrambled - 7 freq scrammlit - 1 freq |
SCRAMMLIT |
| Time to execute Levenshtein function - 0.191946 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.372724 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.027646 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.038465 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.000925 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. |