| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cummersum (0) - 1 freq summers (3) - 13 freq cumers (3) - 1 freq bummers (3) - 18 freq scunnersum (3) - 1 freq nummers (3) - 110 freq cummer (3) - 6 freq cummerit (3) - 1 freq hummered (4) - 1 freq bummerie (4) - 1 freq curers (4) - 1 freq nummert (4) - 4 freq limmers (4) - 4 freq nummerin (4) - 6 freq dumpers (4) - 1 freq clivversum (4) - 3 freq hemmers (4) - 1 freq dulesum (4) - 1 freq scammers (4) - 1 freq immersd (4) - 1 freq immerse (4) - 3 freq cullers (4) - 1 freq commerce (4) - 4 freq cummelled (4) - 2 freq campers (4) - 2 freq |
cummersum (0) - 1 freq cummer (5) - 6 freq nummers (5) - 110 freq cummerit (5) - 1 freq summers (5) - 13 freq cumers (5) - 1 freq bummers (5) - 18 freq yammers (6) - 3 freq cummins (6) - 1 freq immersed (6) - 4 freq emmers (6) - 4 freq gimmers (6) - 5 freq emmerson (6) - 1 freq memmers (6) - 41 freq summertime (6) - 1 freq incummers (6) - 4 freq simmerdim (6) - 3 freq timmers (6) - 6 freq comers (6) - 2 freq simmers' (6) - 1 freq immersin (6) - 1 freq chaummers (6) - 1 freq hammers (6) - 6 freq commer (6) - 1 freq campers (6) - 2 freq |
SoundEx code - C562 chaumers - 14 freq cinners - 4 freq cameras - 10 freq comers - 2 freq commercial - 16 freq commercialise - 1 freq connerik - 2 freq commerce - 4 freq conract - 1 freq camras - 1 freq commercially - 1 freq chaumer's - 1 freq chaummers - 1 freq chaamer-quine - 1 freq connery's - 1 freq conneryscottishwalks - 1 freq cumers - 1 freq chimaeras - 1 freq cummersum - 1 freq conorsharkeysc - 1 freq conorkelly - 1 freq commercialism - 1 freq connorjbyrne - 1 freq comer's - 1 freq camera's - 1 freq cymrawes - 3 freq conorscott - 1 freq cymrogav - 1 freq |
MetaPhone code - KMRSM cummersum - 1 freq |
CUMMERSUM |
| Time to execute Levenshtein function - 0.198321 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.394073 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.028443 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.037022 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.000877 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. |