| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| comers (0) - 2 freq covers (1) - 51 freq comer's (1) - 1 freq comes (1) - 962 freq comets (1) - 12 freq come's (1) - 1 freq cumers (1) - 1 freq comer (1) - 4 freq powers (2) - 16 freq memers (2) - 1 freq coneys (2) - 1 freq bombers (2) - 7 freq coppers (2) - 9 freq cowert (2) - 2 freq sobers (2) - 1 freq towers (2) - 19 freq cowsers (2) - 1 freq cumes (2) - 1 freq cabers (2) - 4 freq coffers (2) - 2 freq comber (2) - 2 freq coles (2) - 4 freq cones (2) - 3 freq scorers (2) - 1 freq capers (2) - 7 freq |
comers (0) - 2 freq cumers (1) - 1 freq cameras (2) - 10 freq come's (2) - 1 freq comer (2) - 4 freq comets (2) - 12 freq comer's (2) - 1 freq comes (2) - 962 freq covers (2) - 51 freq clooers (3) - 1 freq coars (3) - 1 freq comms (3) - 1 freq timers (3) - 5 freq comics (3) - 20 freq combs (3) - 7 freq coosers (3) - 1 freq commas (3) - 3 freq cheers (3) - 219 freq curers (3) - 1 freq aamers (3) - 1 freq emmers (3) - 4 freq cours (3) - 3 freq boomers (3) - 1 freq camras (3) - 1 freq cavers (3) - 6 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 - KMRS cameras - 10 freq comers - 2 freq gumrie's - 1 freq commerce - 4 freq camras - 1 freq quoymirris - 1 freq cumers - 1 freq comer's - 1 freq camera's - 1 freq |
COMERS |
| Time to execute Levenshtein function - 0.244804 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.442727 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.034233 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.043327 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.001189 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. |