Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
commercial (0) - 16 freq commercially (2) - 1 freq commercialism (3) - 1 freq commerce (3) - 4 freq commercialise (3) - 1 freq communal (4) - 7 freq mercian (4) - 4 freq comedian (4) - 5 freq gomeril (4) - 15 freq novercal (4) - 1 freq commonweal (4) - 3 freq comical (4) - 4 freq commenced (4) - 3 freq imperial (4) - 21 freq comperit (4) - 1 freq mercia (4) - 13 freq cummerit (4) - 1 freq compering (4) - 1 freq cordial (4) - 6 freq commentit (4) - 3 freq congenial (4) - 2 freq commence (4) - 4 freq commemorat (4) - 1 freq commending (4) - 1 freq offeicial (4) - 17 freq |
commercial (0) - 16 freq commercially (3) - 1 freq commercialise (4) - 1 freq commerce (4) - 4 freq commercialism (5) - 1 freq comical (6) - 4 freq commenced (6) - 3 freq commonweal (6) - 3 freq commences (6) - 2 freq communal (6) - 7 freq commer (6) - 1 freq cummerit (6) - 1 freq commence (6) - 4 freq immortal (7) - 21 freq cummer (7) - 6 freq clerical (7) - 2 freq chemiecal (7) - 1 freq chemical (7) - 10 freq 'ammiral (7) - 3 freq crucial (7) - 18 freq emmerdale (7) - 3 freq charcoal (7) - 3 freq camceil (7) - 2 freq memorial (7) - 37 freq cummersum (7) - 1 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 - KMRXL commercial - 16 freq commercially - 1 freq |
COMMERCIAL |
Time to execute Levenshtein function - 0.235095 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.351826 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.027397 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.039947 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.000988 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. |