| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coveted (0) - 4 freq covered (1) - 124 freq coated (2) - 4 freq coasted (2) - 1 freq dovered (2) - 6 freq hovered (2) - 11 freq covet (2) - 3 freq convened (2) - 3 freq coonted (2) - 16 freq counted (2) - 13 freq couered (2) - 1 freq riveted (2) - 1 freq conveyed (2) - 2 freq coorted (2) - 2 freq converted (2) - 6 freq comete (2) - 1 freq coveret (2) - 2 freq closeted (2) - 1 freq chetted (3) - 1 freq corssed (3) - 2 freq consented (3) - 1 freq convoyed (3) - 2 freq reeted (3) - 4 freq compete (3) - 11 freq couried (3) - 6 freq |
coveted (0) - 4 freq covered (2) - 124 freq coonted (3) - 16 freq counted (3) - 13 freq covet (3) - 3 freq coorted (3) - 2 freq coated (3) - 4 freq riveted (3) - 1 freq coasted (3) - 1 freq voted (4) - 41 freq devoted (4) - 4 freq cited (4) - 3 freq carted (4) - 2 freq created (4) - 27 freq clouted (4) - 1 freq covetous (4) - 1 freq invited (4) - 38 freq cairted (4) - 5 freq covid (4) - 73 freq casted (4) - 2 freq covetice (4) - 1 freq cheated (4) - 2 freq vetoed (4) - 1 freq couered (4) - 1 freq conveyed (4) - 2 freq |
SoundEx code - C133 coveted - 4 freq cohabitate - 1 freq cohabitatin - 1 freq cohabitation - 1 freq |
MetaPhone code - KFTT coveted - 4 freq |
COVETED |
| Time to execute Levenshtein function - 0.225983 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.412207 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.029681 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.040209 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.000840 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. |