| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ictfc (0) - 3 freq atfc (2) - 3 freq ict (2) - 1 freq ctf (2) - 1 freq itfy (2) - 1 freq itc (2) - 1 freq scfc (2) - 1 freq mcfc (2) - 2 freq intac (2) - 2 freq icic (2) - 1 freq iufc (2) - 1 freq fc (3) - 54 freq ici (3) - 2 freq scuff (3) - 4 freq cto (3) - 1 freq icys (3) - 1 freq ist (3) - 11 freq scoff (3) - 12 freq cafe (3) - 31 freq cuff (3) - 4 freq inuff (3) - 1 freq ithe (3) - 14 freq etec (3) - 1 freq iqczc (3) - 1 freq ecc (3) - 1 freq |
ictfc (0) - 3 freq ctf (3) - 1 freq atfc (3) - 3 freq intac (4) - 2 freq icic (4) - 1 freq htafc (4) - 11 freq mcfc (4) - 2 freq iufc (4) - 1 freq scfc (4) - 1 freq ict (4) - 1 freq itfy (4) - 1 freq itc (4) - 1 freq artic (5) - 2 freq cfp (5) - 2 freq jtc (5) - 1 freq ccxic (5) - 1 freq cvc (5) - 2 freq ytfh (5) - 1 freq gsfc (5) - 2 freq afc (5) - 27 freq iectur (5) - 1 freq cf (5) - 12 freq cfm (5) - 1 freq cts (5) - 1 freq thc (5) - 3 freq |
SoundEx code - I231 i'stuff - 1 freq i'stupid - 1 freq ictfc - 3 freq igxcdbea - 1 freq ijdbytdmce - 1 freq iqdfznd - 1 freq |
MetaPhone code - IKTFK ictfc - 3 freq |
ICTFC |
| Time to execute Levenshtein function - 0.210485 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.485224 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.068394 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.038286 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.001129 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. |