| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caverns (0) - 4 freq taverns (1) - 9 freq cavern (1) - 4 freq cavers (1) - 6 freq savers (2) - 1 freq havers (2) - 35 freq cabers (2) - 4 freq caerds (2) - 1 freq caves (2) - 17 freq capers (2) - 7 freq cameras (2) - 10 freq covers (2) - 51 freq saveens (2) - 1 freq cave's (2) - 1 freq cairns (2) - 13 freq laerns (2) - 4 freq havens (2) - 1 freq cravens (2) - 1 freq caterans (2) - 5 freq coverts (2) - 1 freq caven (2) - 1 freq carers (2) - 11 freq clavers (2) - 15 freq caveats (2) - 1 freq ravens (2) - 5 freq |
caverns (0) - 4 freq cavers (2) - 6 freq cavern (2) - 4 freq taverns (2) - 9 freq caterans (3) - 5 freq camerons (3) - 1 freq covers (3) - 51 freq coverts (3) - 1 freq cairns (3) - 13 freq coverin (4) - 29 freq caper's (4) - 1 freq caers (4) - 1 freq wavers (4) - 1 freq covering (4) - 6 freq cameroons (4) - 2 freq acorns (4) - 1 freq coverin' (4) - 1 freq churns (4) - 4 freq coveran (4) - 2 freq cevennes (4) - 1 freq cuivers (4) - 2 freq cuveren (4) - 1 freq curns (4) - 127 freq tavern (4) - 16 freq corns (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 - KFRNS caverns - 4 freq governess - 4 freq |
CAVERNS |
| Time to execute Levenshtein function - 0.413696 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.660560 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.027913 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.077166 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.001168 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. |