| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coverin (0) - 29 freq doverin (1) - 15 freq coverin' (1) - 1 freq coherin (1) - 1 freq covering (1) - 6 freq coverit (1) - 6 freq coveran (1) - 2 freq cowerin (1) - 5 freq couerin (1) - 1 freq covemin (1) - 1 freq hoverin (1) - 23 freq governin (2) - 4 freq covered (2) - 124 freq pooerin (2) - 1 freq cowarin (2) - 2 freq powerin (2) - 3 freq coven (2) - 4 freq covert (2) - 39 freq lowerin (2) - 12 freq leverin (2) - 2 freq waverin (2) - 1 freq hooverin (2) - 5 freq caterin (2) - 4 freq haverin (2) - 25 freq coveret (2) - 2 freq |
coverin (0) - 29 freq coveran (1) - 2 freq hoverin (2) - 23 freq cuveren (2) - 1 freq cavern (2) - 4 freq cuiverin (2) - 1 freq couerin (2) - 1 freq covemin (2) - 1 freq cowerin (2) - 5 freq coherin (2) - 1 freq coverin' (2) - 1 freq covering (2) - 6 freq doverin (2) - 15 freq coverit (2) - 6 freq cheerin (3) - 25 freq cowrin (3) - 5 freq coorin (3) - 3 freq sovrin (3) - 1 freq recoverin (3) - 7 freq courin (3) - 1 freq hoveran (3) - 1 freq cover (3) - 147 freq severin (3) - 1 freq kiverin (3) - 2 freq covers (3) - 51 freq |
SoundEx code - C165 caperin - 3 freq coverin - 29 freq capering - 1 freq cavern - 4 freq covering - 6 freq cuveren - 1 freq cayperen - 1 freq chaperone - 1 freq capernoitie - 1 freq copernicus's - 1 freq cuprinol - 1 freq cap'rin - 1 freq capernaum - 15 freq 'capernoited - 1 freq caverns - 4 freq coveran - 2 freq coverin' - 1 freq caperan - 1 freq capernoited - 1 freq cuiverin - 1 freq cheeperin - 1 freq cybermen - 1 freq capernoitit - 1 freq co-brandit - 1 freq cyber-een - 1 freq coburn - 3 freq coverangersfc - 1 freq cobramanu - 1 freq cfreun - 1 freq |
MetaPhone code - KFRN coverin - 29 freq kiverin - 2 freq cavern - 4 freq cuveren - 1 freq quiverin - 7 freq coveran - 2 freq coverin' - 1 freq govern - 3 freq cuiverin - 1 freq kivverin - 2 freq kivvverin - 1 freq kforn - 1 freq kavrny - 1 freq cfreun - 1 freq |
COVERIN |
| Time to execute Levenshtein function - 0.511225 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 - 1.390248 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.097676 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.116648 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.001180 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. |