| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| screenin (0) - 2 freq screening (1) - 1 freq screengin (1) - 24 freq screevin (1) - 7 freq screin (2) - 3 freq seenin (2) - 1 freq screen's (2) - 1 freq scrannin (2) - 6 freq greenin (2) - 7 freq screechin (2) - 11 freq screens (2) - 22 freq screamin (2) - 72 freq scraepin (2) - 1 freq screenge (2) - 3 freq screivin (2) - 64 freq careenin (2) - 1 freq screevit (2) - 3 freq creelin (2) - 2 freq sheenin (2) - 26 freq screevins (2) - 4 freq screarnin (2) - 1 freq creepin (2) - 50 freq creesin (2) - 1 freq screen (2) - 140 freq screwin (2) - 7 freq |
screenin (0) - 2 freq screengin (2) - 24 freq screevin (2) - 7 freq screening (2) - 1 freq screened (3) - 1 freq careenin (3) - 1 freq screivin (3) - 64 freq screarnin (3) - 1 freq screen (3) - 140 freq screwin (3) - 7 freq screenge (3) - 3 freq scrievin (3) - 161 freq scraepin (3) - 1 freq screin (3) - 3 freq scrannin (3) - 6 freq screens (3) - 22 freq screamin (3) - 72 freq sickenin (4) - 4 freq scringin (4) - 1 freq schenan (4) - 1 freq scrybin (4) - 2 freq cruinin (4) - 1 freq scrapin (4) - 19 freq strainin (4) - 9 freq scryin (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 - SKRNN scrannin - 6 freq screenin - 2 freq |
SCREENIN |
| Time to execute Levenshtein function - 0.197886 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.352743 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.059743 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.040151 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.000852 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. |