| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| covenant (0) - 48 freq covenant' (1) - 1 freq covemnant (1) - 1 freq coveynant (1) - 2 freq covenantin (2) - 21 freq coveynants (2) - 1 freq covenanter (2) - 10 freq coveran (2) - 2 freq novena (3) - 1 freq covemin (3) - 1 freq govenment (3) - 1 freq joecovenant (3) - 4 freq copeland (3) - 1 freq governent (3) - 1 freq covenanting (3) - 1 freq opennt (3) - 1 freq cover't (3) - 3 freq covenanters (3) - 57 freq reverant (3) - 3 freq cownan (3) - 1 freq coverin' (3) - 1 freq coverall (3) - 1 freq caveman (3) - 3 freq covet (3) - 3 freq caveat (3) - 1 freq |
covenant (0) - 48 freq coveynant (1) - 2 freq covenant' (2) - 1 freq covemnant (2) - 1 freq covenanter (3) - 10 freq covenantin (3) - 21 freq coveynants (3) - 1 freq joecovenant (4) - 4 freq convenient (4) - 5 freq coveran (4) - 2 freq courrant (5) - 1 freq dominant (5) - 19 freq coverit (5) - 6 freq coventry (5) - 4 freq coven (5) - 4 freq convent (5) - 3 freq forenent (5) - 68 freq coveret (5) - 2 freq coverin (5) - 29 freq coherent (5) - 10 freq governt (5) - 1 freq evenan (5) - 2 freq poignant (5) - 5 freq cogent (5) - 1 freq movement (5) - 68 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 |
COVENANT |
| Time to execute Levenshtein function - 0.224973 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.360859 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.027600 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.037754 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.000950 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. |