| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| screamin (0) - 73 freq screamit (1) - 2 freq streamin (1) - 16 freq screamin' (1) - 1 freq screaming (1) - 9 freq screaman (1) - 5 freq scrimin (2) - 2 freq schemin (2) - 3 freq screaminly (2) - 1 freq screin (2) - 3 freq streaming (2) - 2 freq streaman (2) - 1 freq creatin (2) - 25 freq scream (2) - 67 freq screenin (2) - 2 freq creakin (2) - 15 freq scream' (2) - 1 freq dreamin (2) - 38 freq screams (2) - 33 freq steamin (2) - 23 freq screevin (2) - 7 freq screamt (2) - 4 freq screwin (2) - 7 freq screivin (2) - 67 freq screchin (2) - 1 freq |
screamin (0) - 73 freq screaman (1) - 5 freq screamit (2) - 2 freq streamin (2) - 16 freq scrimin (2) - 2 freq screaming (2) - 9 freq screamin' (2) - 1 freq screamt (3) - 4 freq screevin (3) - 7 freq screams (3) - 33 freq screwin (3) - 7 freq scream' (3) - 1 freq sereaman (3) - 1 freq screamed (3) - 39 freq screivin (3) - 67 freq scrapin (3) - 20 freq schemin (3) - 3 freq streaman (3) - 1 freq screin (3) - 3 freq scream (3) - 67 freq screaminly (3) - 1 freq screenin (3) - 2 freq scran (4) - 84 freq scrumpin (4) - 1 freq scrievin (4) - 163 freq |
SoundEx code - S655 surmoontit - 1 freq sermon - 29 freq screamin - 73 freq surnem - 2 freq surnames - 4 freq swarmin - 6 freq scrannin - 6 freq screaman - 5 freq surname - 12 freq screamin' - 1 freq screaming - 9 freq sherman - 1 freq sermons - 9 freq screaminly - 1 freq scaremongerin - 2 freq squirmin - 3 freq swairmin - 2 freq scrimin - 2 freq sereaman - 1 freq swearin-in - 1 freq surrounnins - 1 freq scorninly - 1 freq scare-mongerin - 1 freq sairmons - 1 freq screening - 1 freq screenin - 2 freq |
MetaPhone code - SKRMN screamin - 73 freq screaman - 5 freq screamin' - 1 freq squirmin - 3 freq scrimin - 2 freq |
SCREAMIN |
| Time to execute Levenshtein function - 0.199058 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.339761 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.027478 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.037292 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.000882 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. |