| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coupons (0) - 10 freq coupon (1) - 52 freq commons (2) - 8 freq couples (2) - 14 freq cocoons (2) - 1 freq coupen (2) - 1 freq coups (2) - 2 freq cousins (2) - 46 freq coupan (2) - 1 freq couplins (2) - 1 freq couping (2) - 1 freq coupin (2) - 7 freq repons (3) - 1 freq coops (3) - 1 freq corona (3) - 19 freq gowpens (3) - 1 freq coupt (3) - 3 freq opon (3) - 1 freq couldno (3) - 5 freq neurons (3) - 1 freq cojones (3) - 1 freq woons (3) - 1 freq couped (3) - 9 freq cuppas (3) - 1 freq coudna (3) - 47 freq |
coupons (0) - 10 freq coupon (2) - 52 freq coupan (3) - 1 freq couplins (3) - 1 freq coupin (3) - 7 freq cousins (3) - 46 freq couping (3) - 1 freq coups (3) - 2 freq cocoons (3) - 1 freq couples (3) - 14 freq coupen (3) - 1 freq oapens (4) - 1 freq copinsay (4) - 2 freq copies (4) - 40 freq coins (4) - 50 freq corns (4) - 1 freq crayons (4) - 4 freq cuns (4) - 1 freq coopin (4) - 1 freq cabons (4) - 1 freq capon (4) - 1 freq cons (4) - 4 freq canons (4) - 1 freq copan (4) - 1 freq coping (4) - 2 freq |
SoundEx code - C152 coffins' - 2 freq chaffinches - 1 freq chauvinist - 1 freq coupons - 10 freq cabons - 1 freq cauf-muscles - 1 freq cauf-muscle - 1 freq coffin's - 1 freq cabins - 2 freq cupiennius - 1 freq copinsay - 2 freq cevennes - 1 freq cofhns - 1 freq coffins - 6 freq chiffins - 1 freq chiefness - 1 freq chaffing - 2 freq chauvinism - 1 freq cowping - 1 freq cupping - 1 freq covington - 1 freq chapping - 5 freq chauvinistic - 1 freq cvmkjktklr - 1 freq coping - 2 freq chiefmiekelson - 1 freq cifmcd - 1 freq chefmcalpine - 1 freq chopping - 1 freq couping - 1 freq chipping - 1 freq cbymooqj - 1 freq |
MetaPhone code - KPNS coupons - 10 freq cupiennius - 1 freq copinsay - 2 freq gowpens - 1 freq gowpins - 1 freq |
COUPONS |
| Time to execute Levenshtein function - 0.188224 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.331880 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.027418 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.038218 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.000903 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. |