| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| screamin (0) - 72 freq screamin' (1) - 1 freq streamin (1) - 16 freq screamit (1) - 2 freq screaming (1) - 8 freq screaman (1) - 5 freq streaman (2) - 1 freq screarnin (2) - 1 freq screchin (2) - 1 freq dreamin (2) - 38 freq screenin (2) - 2 freq screivin (2) - 64 freq reamin (2) - 6 freq streamin' (2) - 3 freq screamt (2) - 4 freq creasin (2) - 4 freq schemin (2) - 3 freq creatin (2) - 25 freq creakin (2) - 14 freq screwin (2) - 7 freq scream' (2) - 1 freq sereaman (2) - 1 freq streaming (2) - 2 freq scrimin (2) - 2 freq steamin (2) - 21 freq |
screamin (0) - 72 freq screaman (1) - 5 freq scrimin (2) - 2 freq streamin (2) - 16 freq screamin' (2) - 1 freq screamit (2) - 2 freq screaming (2) - 8 freq scrapin (3) - 19 freq scream' (3) - 1 freq screin (3) - 3 freq sereaman (3) - 1 freq scream (3) - 64 freq screwin (3) - 7 freq screamed (3) - 38 freq screevin (3) - 7 freq screams (3) - 32 freq screaminly (3) - 1 freq streaman (3) - 1 freq screenin (3) - 2 freq screamt (3) - 4 freq screivin (3) - 64 freq schemin (3) - 3 freq scrybin (4) - 2 freq scrapan (4) - 2 freq scraun (4) - 1 freq |
SoundEx code - S655 surmoontit - 1 freq sermon - 29 freq screamin - 72 freq surnem - 2 freq surnames - 4 freq swarmin - 6 freq scrannin - 6 freq screaman - 5 freq surname - 12 freq screamin' - 1 freq sherman - 1 freq sermons - 9 freq screaminly - 1 freq scaremongerin - 2 freq screaming - 8 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 - 72 freq screaman - 5 freq screamin' - 1 freq squirmin - 3 freq scrimin - 2 freq |
SCREAMIN |
| Time to execute Levenshtein function - 0.181713 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.329563 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.027130 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.036462 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.000818 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. |