| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ctf (0) - 1 freq cif (1) - 4 freq ct (1) - 8 freq caf (1) - 2 freq gtf (1) - 2 freq cf (1) - 12 freq wtf (1) - 14 freq etf (1) - 1 freq btf (1) - 8 freq ctw (1) - 1 freq tf (1) - 9 freq cto (1) - 1 freq cts (1) - 1 freq ckf (1) - 1 freq td (2) - 9 freq wtt (2) - 1 freq cas (2) - 4 freq cym (2) - 6 freq cep (2) - 1 freq tm (2) - 7 freq szf (2) - 1 freq hof (2) - 1 freq hts (2) - 5 freq dif (2) - 2 freq owf (2) - 1 freq |
ctf (0) - 1 freq ctw (2) - 1 freq btf (2) - 8 freq tf (2) - 9 freq cts (2) - 1 freq ckf (2) - 1 freq etf (2) - 1 freq cto (2) - 1 freq cif (2) - 4 freq wtf (2) - 14 freq caf (2) - 2 freq ct (2) - 8 freq gtf (2) - 2 freq cf (2) - 12 freq cute (3) - 41 freq conf (3) - 1 freq cafe (3) - 31 freq act' (3) - 2 freq taf (3) - 1 freq calf (3) - 12 freq acts (3) - 43 freq cot (3) - 44 freq cit (3) - 4 freq tfi (3) - 2 freq cato (3) - 1 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 - KTF guidwyfe - 24 freq cud'v - 1 freq cuddief - 1 freq cud've - 3 freq guid-wyfe - 3 freq qdf - 1 freq kkwdf - 1 freq kdf - 1 freq gtf - 2 freq ctf - 1 freq qdvw - 1 freq cdv - 1 freq |
CTF |
| Time to execute Levenshtein function - 0.216784 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.433772 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.031104 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.036775 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.000923 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. |