| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shoormal (0) - 9 freq shoormail (1) - 1 freq shörmal (2) - 4 freq shoal (3) - 2 freq normal (3) - 1 freq shoorie (3) - 1 freq shooda (3) - 5 freq shoodnae (3) - 1 freq noarmal (3) - 1 freq shootan (3) - 5 freq shoory (3) - 3 freq showman (3) - 4 freq chordal (3) - 1 freq hoora (3) - 3 freq doorman (3) - 2 freq choral (3) - 2 freq shoors (3) - 34 freq ormal (3) - 1 freq sooran (3) - 1 freq shoom (3) - 1 freq abnormal (3) - 2 freq shoomin (3) - 1 freq sherman (3) - 1 freq rooral (3) - 1 freq thermal (3) - 12 freq |
shoormal (0) - 9 freq shoormail (1) - 1 freq thermal (4) - 12 freq sherman (4) - 1 freq shörmal (4) - 4 freq shoorin (5) - 1 freq shool (5) - 1 freq gormal (5) - 1 freq formal (5) - 59 freq shoomin (5) - 1 freq shoor (5) - 70 freq shomac (5) - 8 freq shrooms (5) - 1 freq shoartly (5) - 2 freq shemale (5) - 1 freq shrill (5) - 20 freq abnormal (5) - 2 freq shortly (5) - 31 freq informal (5) - 18 freq normal (5) - 130 freq shoorie (5) - 1 freq shtml (5) - 2 freq showman (5) - 4 freq shoory (5) - 3 freq shoom (5) - 1 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 - 5 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 - XRML shoormal - 9 freq 'shroomal' - 1 freq shoormail - 1 freq shörmal - 4 freq |
SHOORMAL |
| Time to execute Levenshtein function - 0.185716 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.351911 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.027074 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.039333 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.000812 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. |