| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| conceivable (0) - 4 freq conceive (3) - 2 freq conceals (4) - 1 freq conceivit (4) - 1 freq commendable (4) - 1 freq conseiderable (4) - 2 freq conceivin (4) - 3 freq conceived (4) - 10 freq concealed (4) - 2 freq concealer (4) - 2 freq sociable (4) - 7 freq contrivance (4) - 1 freq concealt (4) - 1 freq conceal (4) - 6 freq formeidable (4) - 1 freq constable (4) - 24 freq confeirance (4) - 2 freq connive (5) - 1 freq congealed (5) - 3 freq forgettable (5) - 1 freq ooncoontable (5) - 1 freq concedan (5) - 1 freq unreadable (5) - 2 freq unmendable (5) - 1 freq concede (5) - 5 freq |
conceivable (0) - 4 freq conceive (5) - 2 freq conceived (6) - 10 freq constable (6) - 24 freq conceivin (6) - 3 freq conceal (6) - 6 freq conceivit (6) - 1 freq conceals (7) - 1 freq confabble (7) - 2 freq conseiderable (7) - 2 freq unviable (7) - 1 freq incapable (7) - 7 freq incurable (7) - 1 freq enviable (7) - 1 freq lunchable (7) - 1 freq incivile (7) - 1 freq concealed (7) - 2 freq sociable (7) - 7 freq concealer (7) - 2 freq conceptual (7) - 2 freq achievable (7) - 4 freq convivial (7) - 2 freq concealt (7) - 1 freq unbearable (8) - 2 freq constables (8) - 5 freq |
SoundEx code - C521 conceivable - 4 freq conspiratorial - 4 freq concept - 37 freq concepts - 10 freq conception - 4 freq conceive - 2 freq concubines - 6 freq conceived - 10 freq conspire - 2 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 conceptual - 2 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 - KNSFBL conceivable - 4 freq |
CONCEIVABLE |
| Time to execute Levenshtein function - 0.206703 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.380377 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.027907 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.040284 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.000819 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. |