| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cavalry (0) - 18 freq cavafy (2) - 1 freq lavatry (2) - 1 freq canary (2) - 14 freq chivalry (2) - 1 freq calvary (2) - 2 freq rivalry (2) - 2 freq caviare (3) - 1 freq clarry (3) - 2 freq devilry (3) - 2 freq caalin (3) - 2 freq casualty (3) - 13 freq cavern (3) - 4 freq canal (3) - 27 freq caalan (3) - 2 freq caall (3) - 2 freq cairy (3) - 16 freq cantley (3) - 1 freq canali (3) - 2 freq caerry (3) - 2 freq yaval (3) - 1 freq canals (3) - 3 freq casually (3) - 14 freq chalky (3) - 2 freq caalm (3) - 1 freq |
cavalry (0) - 18 freq chivalry (3) - 1 freq rivalry (3) - 2 freq revelry (4) - 2 freq caaler (4) - 1 freq cleary (4) - 1 freq cavafy (4) - 1 freq caviar (4) - 11 freq divilry (4) - 1 freq caviaar (4) - 1 freq devilry (4) - 2 freq canary (4) - 14 freq lavatry (4) - 1 freq calvary (4) - 2 freq caviare (4) - 1 freq caleery (4) - 2 freq carolro (4) - 17 freq naval (5) - 8 freq claire (5) - 10 freq cavity (5) - 2 freq caar (5) - 1 freq caal (5) - 99 freq cary (5) - 1 freq cava (5) - 1 freq cairry (5) - 211 freq |
SoundEx code - C146 chevaliers - 1 freq cavalry - 18 freq chivalrous - 2 freq chaipel-reekit - 1 freq chivalry - 1 freq chevalrie - 1 freq caballero - 1 freq cabellero - 2 freq cobler - 1 freq chivalrously - 1 freq cobbler - 2 freq chefpaulrankin - 1 freq |
MetaPhone code - KFLR cavalry - 18 freq |
CAVALRY |
| Time to execute Levenshtein function - 0.186943 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.342167 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.029870 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.036622 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.000803 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. |