Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
screaming (0) - 9 freq screamin' (1) - 1 freq streaming (1) - 2 freq screamin (1) - 73 freq creating (2) - 8 freq creaking (2) - 2 freq dreaming (2) - 3 freq screamit (2) - 2 freq screiving (2) - 3 freq screaman (2) - 5 freq streamin (2) - 16 freq streamin' (2) - 3 freq scraping (2) - 2 freq screaminly (2) - 1 freq screening (2) - 1 freq steaming (2) - 2 freq spreading (2) - 8 freq screwin (3) - 7 freq creeping (3) - 5 freq screenin (3) - 2 freq increasing (3) - 2 freq sweating (3) - 2 freq screchin (3) - 1 freq scrimin (3) - 2 freq scream (3) - 67 freq |
screaming (0) - 9 freq screamin (2) - 73 freq streaming (2) - 2 freq screamin' (2) - 1 freq screaman (3) - 5 freq scraping (3) - 2 freq screiving (3) - 3 freq screening (3) - 1 freq screaminly (3) - 1 freq scrieving (4) - 5 freq scaring (4) - 4 freq spreading (4) - 8 freq scrimin (4) - 2 freq steaming (4) - 2 freq dreaming (4) - 3 freq streamin' (4) - 3 freq screamit (4) - 2 freq creaking (4) - 2 freq creating (4) - 8 freq streamin (4) - 16 freq screenge (5) - 3 freq scurrying (5) - 1 freq screeching (5) - 3 freq stramin' (5) - 1 freq streaman (5) - 1 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 - SKRMNK screaming - 9 freq |
SCREAMING |
Time to execute Levenshtein function - 0.183328 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.366123 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.027861 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.037279 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.000940 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. |