| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cuveren (0) - 1 freq cuver'd (2) - 2 freq covered (2) - 124 freq cavemen (2) - 1 freq cuiverin (2) - 1 freq coveran (2) - 2 freq coverin (2) - 29 freq coveret (2) - 2 freq cavern (2) - 4 freq cuvert (2) - 1 freq cleen (3) - 3 freq caven (3) - 1 freq cern (3) - 1 freq coulered (3) - 1 freq weeren (3) - 1 freq tureen (3) - 4 freq caperan (3) - 1 freq loveen (3) - 1 freq claverin (3) - 8 freq haverin (3) - 25 freq quivered (3) - 3 freq leverin (3) - 2 freq soberen (3) - 1 freq covereth (3) - 1 freq covert (3) - 39 freq |
cuveren (0) - 1 freq coveran (2) - 2 freq coverin (2) - 29 freq cuiverin (2) - 1 freq cavern (2) - 4 freq cavemen (3) - 1 freq cuvert (3) - 1 freq coveret (3) - 2 freq covered (3) - 124 freq caveman (4) - 3 freq caperin (4) - 3 freq cuuver (4) - 1 freq cuivers (4) - 2 freq coven (4) - 4 freq curin (4) - 5 freq quiverin (4) - 7 freq couerin (4) - 1 freq coverin' (4) - 1 freq cameron (4) - 127 freq coverit (4) - 6 freq severin (4) - 1 freq cheerin (4) - 25 freq tavern (4) - 16 freq curran (4) - 2 freq coherin (4) - 1 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 |
CUVEREN |
| Time to execute Levenshtein function - 0.205467 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.392000 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.028523 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.042907 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.000980 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. |