Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
clickbait (0) - 2 freq clickit (2) - 7 freq clickimin (3) - 1 freq flickerit (3) - 1 freq flickit (3) - 7 freq clockit (3) - 2 freq slickit (3) - 2 freq clickt (3) - 2 freq clickan (3) - 2 freq clinkit (3) - 1 freq cleckit (3) - 6 freq lickit (3) - 19 freq clickin (3) - 13 freq climbit (3) - 3 freq chockit (4) - 2 freq flickerin (4) - 17 freq climbin (4) - 18 freq spickit (4) - 1 freq clekkit (4) - 1 freq clookit (4) - 2 freq likit (4) - 157 freq lickan (4) - 3 freq prickit (4) - 3 freq trickit (4) - 26 freq wickit (4) - 36 freq |
clickbait (0) - 2 freq clickit (3) - 7 freq clickt (4) - 2 freq cleckit (4) - 6 freq clockit (4) - 2 freq lickit (5) - 19 freq climbit (5) - 3 freq clocket (5) - 1 freq clockt (5) - 1 freq clickety (5) - 1 freq clickin (5) - 13 freq slickit (5) - 2 freq clinkit (5) - 1 freq flickit (5) - 7 freq flickerit (5) - 1 freq clickimin (5) - 1 freq clickan (5) - 2 freq cockpit (6) - 5 freq clicky's (6) - 9 freq lackit (6) - 1 freq clicky've (6) - 1 freq crackit (6) - 21 freq clicky (6) - 41 freq chuckit (6) - 3 freq fleckit (6) - 3 freq |
SoundEx code - C421 clesp - 4 freq coal-cowp - 1 freq clesped - 5 freq claspt - 4 freq claspin - 7 freq clasp - 7 freq clock-bee - 1 freq clasped - 7 freq claisp - 1 freq claspit - 4 freq cloghapistol - 1 freq classified - 6 freq clicky've - 1 freq clespit - 3 freq closefamily - 1 freq chalkboard - 1 freq classification - 3 freq classifeed - 1 freq close-pent - 1 freq classifaction - 1 freq clossbye - 1 freq clashbag - 1 freq clacksweb - 1 freq claespoles - 1 freq clessified - 3 freq classifies - 1 freq classifyin - 1 freq clyse-poles - 1 freq clessification - 2 freq clessifyin - 1 freq colspy - 1 freq clessifiein - 1 freq clickbait - 2 freq chelsfergo - 2 freq chelseabronco - 4 freq |
MetaPhone code - KLKBT clickbait - 2 freq |
CLICKBAIT |
Time to execute Levenshtein function - 0.188583 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.388128 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.027701 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.037427 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.001118 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. |