| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| covemin (0) - 1 freq coverin (1) - 29 freq doverin (2) - 15 freq caveman (2) - 3 freq coven (2) - 4 freq yovein (2) - 1 freq couerin (2) - 1 freq covering (2) - 6 freq coverit (2) - 6 freq cowerin (2) - 5 freq cavemen (2) - 1 freq commin (2) - 8 freq coveran (2) - 2 freq coherin (2) - 1 freq coverin' (2) - 1 freq poemin (2) - 1 freq comin (2) - 1066 freq hoverin (2) - 23 freq conveyin (2) - 2 freq comman (3) - 4 freq cowmon (3) - 1 freq cyein (3) - 1 freq lowerin (3) - 12 freq saemin (3) - 1 freq column (3) - 20 freq |
covemin (0) - 1 freq caveman (2) - 3 freq coverin (2) - 29 freq cavemen (2) - 1 freq commin (3) - 8 freq comin (3) - 1066 freq coven (3) - 4 freq coveran (3) - 2 freq coman (4) - 41 freq cavern (4) - 4 freq cimin (4) - 1 freq common (4) - 301 freq cuveren (4) - 1 freq climin (4) - 6 freq cummin (4) - 30 freq comyn (4) - 3 freq cavin (4) - 1 freq caven (4) - 1 freq ciemen (4) - 1 freq caumin (4) - 2 freq coamon (4) - 1 freq cotman (4) - 1 freq cuiverin (4) - 1 freq comeen (4) - 1 freq comon (4) - 1 freq |
SoundEx code - C155 cavewummiin - 1 freq chapman - 8 freq covenanter - 10 freq covenant - 48 freq covenanters - 57 freq covenanters' - 1 freq covenantin - 21 freq coveynanters - 1 freq coveynants - 1 freq coveynant - 2 freq caveman - 3 freq cavemen - 1 freq chapmen - 1 freq covenanter's - 1 freq covenanting - 1 freq covenant' - 1 freq covemnant - 1 freq covemin - 1 freq cafemambo - 1 freq copenhenken - 1 freq |
MetaPhone code - KFMN caveman - 3 freq cavemen - 1 freq covemin - 1 freq hkvymn - 1 freq |
COVEMIN |
| Time to execute Levenshtein function - 0.237582 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.467102 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.028649 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.049446 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.001210 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. |