| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cupiennius (0) - 1 freq eumenius (4) - 1 freq pennies (4) - 24 freq currencies (4) - 1 freq quirinius (4) - 2 freq cuisins (5) - 1 freq consensus (5) - 9 freq plennin (5) - 11 freq chinnin (5) - 1 freq winniks (5) - 2 freq pizenous (5) - 4 freq clinics (5) - 1 freq copies (5) - 41 freq bunnies (5) - 4 freq pennit (5) - 1 freq upendin (5) - 1 freq clannies (5) - 1 freq quinnie (5) - 7 freq penneys (5) - 1 freq quietness (5) - 2 freq cunnin (5) - 6 freq queenis (5) - 1 freq drinnies (5) - 2 freq peencils (5) - 1 freq peenies (5) - 7 freq |
cupiennius (0) - 1 freq pennies (5) - 24 freq spenns (6) - 1 freq clannies (6) - 1 freq penneys (6) - 1 freq openins (6) - 2 freq punnies (6) - 4 freq cunyieins (6) - 1 freq crannies (6) - 4 freq cevennes (6) - 1 freq cuithins (7) - 1 freq tuppens (7) - 1 freq kennins (7) - 6 freq copinsay (7) - 2 freq tinnies (7) - 6 freq clients (7) - 14 freq opinions (7) - 28 freq cinners (7) - 4 freq jennies (7) - 2 freq innins (7) - 17 freq cornelius (7) - 1 freq caunnils (7) - 1 freq mennins (7) - 1 freq pennied (7) - 1 freq cuprous (7) - 1 freq |
SoundEx code - C152 coffins' - 2 freq chaffinches - 1 freq chauvinist - 1 freq coupons - 11 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 - 11 freq cupiennius - 1 freq copinsay - 2 freq gowpens - 1 freq gowpins - 1 freq |
CUPIENNIUS |
| Time to execute Levenshtein function - 0.240126 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.375736 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.032256 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.039322 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.000981 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. |