| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sermon (0) - 29 freq seemon (1) - 17 freq sermons (1) - 9 freq hermon (1) - 1 freq lemon (2) - 23 freq seamen (2) - 5 freq demon (2) - 22 freq seaman (2) - 4 freq vermin (2) - 3 freq sherman (2) - 1 freq hermin (2) - 2 freq vernon (2) - 1 freq serpen (2) - 1 freq wermyon (2) - 1 freq lemmon (2) - 1 freq merton (2) - 4 freq simon (2) - 57 freq servin (2) - 35 freq salmon (2) - 46 freq serrin (2) - 5 freq spron (2) - 1 freq serten (2) - 4 freq semoc (2) - 1 freq seemin (2) - 14 freq person (2) - 231 freq |
sermon (0) - 29 freq seemon (2) - 17 freq hermon (2) - 1 freq srmn (2) - 1 freq sermons (2) - 9 freq ferman (3) - 1 freq seemin (3) - 14 freq serten (3) - 4 freq servan (3) - 4 freq salmon (3) - 46 freq herman (3) - 1 freq german (3) - 156 freq fermin (3) - 32 freq servin (3) - 35 freq saumon (3) - 19 freq summon (3) - 10 freq serrin (3) - 5 freq sherman (3) - 1 freq vermin (3) - 3 freq simon (3) - 57 freq hermin (3) - 2 freq serpen (3) - 1 freq seaman (3) - 4 freq wermyon (3) - 1 freq seamen (3) - 5 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 - SRMN sermon - 29 freq ceremony - 17 freq ceremonie - 3 freq sereaman - 1 freq srmn - 1 freq |
SERMON |
| Time to execute Levenshtein function - 0.194367 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.551580 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.027410 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.089293 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.000810 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. |