| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cvl (0) - 1 freq cvu (1) - 1 freq cv (1) - 4 freq cvh (1) - 1 freq hvl (1) - 2 freq fvl (1) - 1 freq lvl (1) - 1 freq cva (1) - 1 freq cvc (1) - 2 freq col (1) - 11 freq tvl (1) - 1 freq gvl (1) - 1 freq cgl (1) - 2 freq cvs (1) - 1 freq cel (1) - 1 freq vl (1) - 6 freq cal (1) - 29 freq cl (1) - 5 freq iel (2) - 1 freq caal (2) - 98 freq cdv (2) - 1 freq fvp (2) - 1 freq xvq (2) - 1 freq mve (2) - 1 freq aal (2) - 755 freq |
cvl (0) - 1 freq cvs (2) - 1 freq cgl (2) - 2 freq gvl (2) - 1 freq cel (2) - 1 freq cal (2) - 29 freq civil (2) - 38 freq cl (2) - 5 freq tvl (2) - 1 freq vl (2) - 6 freq cvu (2) - 1 freq col (2) - 11 freq cv (2) - 4 freq cvh (2) - 1 freq hvl (2) - 2 freq cvc (2) - 2 freq cva (2) - 1 freq lvl (2) - 1 freq fvl (2) - 1 freq cali (3) - 3 freq evil (3) - 90 freq caul (3) - 79 freq cole (3) - 1 freq cala (3) - 1 freq cule (3) - 1 freq |
SoundEx code - C140 couple - 443 freq civil - 38 freq chaipel - 11 freq cuppla - 2 freq coble - 5 freq ceevil - 45 freq couplae - 3 freq chapel - 37 freq cupwally - 1 freq cupplie - 1 freq coupul - 7 freq cupple - 2 freq caybul - 1 freq cuppul - 1 freq cable - 12 freq cupola - 1 freq 'couple - 1 freq cheaply - 2 freq cobble - 5 freq ceevilly - 5 freq 'capela - 1 freq cïvil - 2 freq chappil - 2 freq coupla - 12 freq copula - 6 freq cabal - 2 freq chiefly - 5 freq cuppil - 1 freq ceivil - 6 freq chaiplie - 1 freq €˜chiefly - 1 freq cÃvil - 1 freq coupl'a - 1 freq couplay - 1 freq cpyl - 1 freq “civil - 1 freq cvl - 1 freq |
MetaPhone code - KFL gavel - 6 freq cïvil - 2 freq kevil - 1 freq cÃvil - 1 freq gvl - 1 freq cvl - 1 freq |
CVL |
| Time to execute Levenshtein function - 0.203759 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.342130 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.028125 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.040189 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.000857 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. |