Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
concep (0) - 9 freq conceps (1) - 4 freq concept (1) - 40 freq concer (1) - 1 freq conner (2) - 2 freq concepts (2) - 10 freq cones (2) - 3 freq concert (2) - 44 freq concede (2) - 5 freq concept' (2) - 1 freq conker (2) - 1 freq nonces (2) - 2 freq oonce (2) - 2 freq cone (2) - 16 freq sconce (2) - 2 freq concret (2) - 1 freq conceal (2) - 6 freq conked (2) - 1 freq conc (2) - 1 freq sconced (2) - 2 freq ponce (2) - 1 freq noncey (2) - 1 freq conned (2) - 1 freq convey (2) - 6 freq cancer (2) - 43 freq |
concep (0) - 9 freq concept (2) - 40 freq concer (2) - 1 freq conceps (2) - 4 freq conceit (3) - 23 freq cancel (3) - 7 freq concur (3) - 5 freq conceal (3) - 6 freq concede (3) - 5 freq cence (3) - 3 freq cancer (3) - 43 freq conc (3) - 1 freq sconces (4) - 1 freq concern (4) - 38 freq confer (4) - 1 freq conter (4) - 47 freq poncey (4) - 2 freq concait (4) - 6 freq council (4) - 58 freq conchie (4) - 1 freq ccp (4) - 3 freq cooncil (4) - 307 freq accep (4) - 12 freq concise (4) - 13 freq coney (4) - 2 freq |
SoundEx code - C521 conceivable - 4 freq conspiratorial - 4 freq concept - 40 freq concepts - 10 freq conception - 4 freq conceive - 2 freq concubines - 6 freq conceived - 10 freq conspire - 2 freq conceptual - 3 freq concept' - 1 freq conspicuous - 4 freq conspiracy - 11 freq concep - 9 freq concepts' - 1 freq conceivit - 1 freq conceivin - 3 freq conspirator - 1 freq conceps - 4 freq chainge-aboot - 1 freq cheengefu - 1 freq conspiratorially - 2 freq conceptualised - 1 freq conceptualise - 2 freq canisp - 1 freq conspirational - 1 freq conspired - 1 freq conspirators - 1 freq conkfgjz - 1 freq cnicpetrat - 1 freq cmuqkfnip - 1 freq cnocbeag - 1 freq cmcfkh - 1 freq |
MetaPhone code - KNSP concep - 9 freq canisp - 1 freq |
CONCEP |
Time to execute Levenshtein function - 0.205385 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.340169 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.027430 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.036855 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.000886 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. |