| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coffins (0) - 6 freq coffin's (1) - 1 freq coffins' (1) - 2 freq boffins (1) - 3 freq coffin (1) - 67 freq confines (2) - 2 freq offin (2) - 20 freq coaffin (2) - 5 freq comfits (2) - 6 freq coffs (2) - 2 freq coffees (2) - 1 freq cofhns (2) - 1 freq coaffin- (2) - 1 freq offing (2) - 1 freq coafin (2) - 1 freq coftin (2) - 1 freq offies (2) - 1 freq doffin (2) - 2 freq scoffin (2) - 4 freq coggins (2) - 1 freq comins (2) - 4 freq cousins (2) - 46 freq daffins (2) - 1 freq boffin (2) - 2 freq coffers (2) - 2 freq |
coffins (0) - 6 freq coffin (2) - 67 freq boffins (2) - 3 freq coffins' (2) - 2 freq coffin's (2) - 1 freq coffen (3) - 2 freq coaffin- (3) - 1 freq daffins (3) - 1 freq cofhns (3) - 1 freq puffins (3) - 5 freq coffers (3) - 2 freq coffs (3) - 2 freq confines (3) - 2 freq coffees (3) - 1 freq coffars (3) - 1 freq coaffin (3) - 5 freq chiffins (3) - 1 freq coins (4) - 52 freq soffin (4) - 1 freq sauffins (4) - 1 freq collins (4) - 3 freq coffeen (4) - 1 freq offense (4) - 1 freq caffeine (4) - 12 freq comfies (4) - 2 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 - KFNS coffins' - 2 freq kevin's - 2 freq coffin's - 1 freq govan's - 1 freq cofhns - 1 freq coffins - 6 freq gavin's - 3 freq |
COFFINS |
| Time to execute Levenshtein function - 0.227901 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.359506 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.027473 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.037360 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.000892 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. |