| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cctv (0) - 6 freq ccv (1) - 1 freq bctv (1) - 1 freq cctd (1) - 1 freq cat (2) - 569 freq itv (2) - 4 freq ceti (2) - 1 freq oct (2) - 4 freq acuv (2) - 1 freq cath (2) - 4 freq ect (2) - 25 freq cits (2) - 1 freq cdv (2) - 1 freq cut' (2) - 2 freq cts (2) - 1 freq cats (2) - 124 freq cce (2) - 1 freq cite (2) - 2 freq cc (2) - 19 freq cut (2) - 461 freq tv (2) - 208 freq cuts (2) - 45 freq ccyh (2) - 1 freq ctf (2) - 1 freq cott (2) - 4 freq |
cctv (0) - 6 freq cctd (2) - 1 freq bctv (2) - 1 freq ccv (2) - 1 freq cata (4) - 1 freq cit (4) - 4 freq ct (4) - 8 freq utv (4) - 1 freq ict (4) - 1 freq ecv (4) - 1 freq ctw (4) - 1 freq citz (4) - 2 freq mtv (4) - 2 freq cute (4) - 41 freq cuv (4) - 3 freq chav (4) - 3 freq cpt (4) - 1 freq cet (4) - 1 freq zctl (4) - 1 freq zct (4) - 1 freq cots (4) - 2 freq cav (4) - 1 freq cov (4) - 1 freq acts (4) - 43 freq cote (4) - 4 freq |
SoundEx code - C310 cud'v - 1 freq cuddief - 1 freq cud've - 3 freq cctv - 6 freq ctf - 1 freq cdv - 1 freq cxwdb - 1 freq citbo - 1 freq cdb - 1 freq chewyytf - 1 freq |
MetaPhone code - KKTF cctv - 6 freq |
CCTV |
| Time to execute Levenshtein function - 0.227808 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.428924 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.028084 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.041226 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.000901 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. |