| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coveynant (0) - 2 freq coveynants (1) - 1 freq covenant (1) - 48 freq covemnant (1) - 1 freq covenant' (2) - 1 freq covenanter (3) - 10 freq covenantin (3) - 21 freq coveynanters (3) - 1 freq governent (3) - 1 freq consonant (3) - 15 freq coveran (3) - 2 freq divaynan (4) - 1 freq constant (4) - 71 freq coverin (4) - 29 freq clephant (4) - 1 freq covemin (4) - 1 freq governin (4) - 4 freq tolerant (4) - 1 freq governit (4) - 2 freq covenanting (4) - 1 freq goverment (4) - 30 freq governin' (4) - 1 freq coveret (4) - 2 freq cogent (4) - 1 freq coventry (4) - 4 freq |
coveynant (0) - 2 freq covenant (1) - 48 freq covemnant (2) - 1 freq coveynants (2) - 1 freq covenant' (3) - 1 freq covenanter (4) - 10 freq covenantin (4) - 21 freq joecovenant (5) - 4 freq convenient (5) - 5 freq coveran (5) - 2 freq governent (5) - 1 freq coveynanters (5) - 1 freq consonant (5) - 15 freq coverit (6) - 6 freq covenanters (6) - 57 freq cownan (6) - 1 freq covet (6) - 3 freq tenant (6) - 14 freq otpynnt (6) - 1 freq hovernut (6) - 3 freq continent (6) - 17 freq cokernit (6) - 1 freq cleanan (6) - 2 freq covert (6) - 38 freq pennant (6) - 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 - KFNNT covenant - 48 freq coveynant - 2 freq covenant' - 1 freq |
COVEYNANT |
| Time to execute Levenshtein function - 0.232409 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.399718 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.031565 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.060488 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.000774 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. |