| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| covenanter (0) - 10 freq covenanters (1) - 57 freq coveynanters (2) - 1 freq covenant' (2) - 1 freq covenanter's (2) - 1 freq covenant (2) - 48 freq covenanters' (2) - 1 freq covenantin (2) - 21 freq coveynants (3) - 1 freq coveynant (3) - 2 freq covenanting (3) - 1 freq covemnant (3) - 1 freq conter (4) - 47 freq cognate (4) - 3 freq corriander (4) - 1 freq commander (4) - 9 freq cevennes (4) - 1 freq colander (4) - 1 freq coventry (4) - 4 freq convener (4) - 18 freq coonter (4) - 70 freq coverage (4) - 15 freq complante (4) - 1 freq noreaster (4) - 1 freq center (4) - 9 freq |
covenanter (0) - 10 freq covenanters (2) - 57 freq covenant (3) - 48 freq covenant' (3) - 1 freq covenantin (3) - 21 freq coveynanters (3) - 1 freq coveynant (4) - 2 freq coveynants (4) - 1 freq covenanter's (4) - 1 freq covenanters' (4) - 1 freq coventry (5) - 4 freq covemnant (5) - 1 freq covenanting (5) - 1 freq coonter (6) - 70 freq center (6) - 9 freq canter (6) - 3 freq conner (6) - 2 freq chanter (6) - 14 freq counter (6) - 19 freq conter (6) - 47 freq cevennes (6) - 1 freq convenient (7) - 5 freq ventir (7) - 1 freq cinner (7) - 1 freq cantor (7) - 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 - KFNNTR covenanter - 10 freq |
COVENANTER |
| Time to execute Levenshtein function - 0.220355 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.347179 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.028390 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.037459 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.000872 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. |