| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| conlude (0) - 1 freq conclude (1) - 11 freq confide (2) - 4 freq concluded (2) - 10 freq concede (2) - 5 freq concludes (2) - 11 freq consume (2) - 3 freq concludet (2) - 1 freq conjure (2) - 5 freq confuse (2) - 8 freq coohide (3) - 1 freq elude (3) - 1 freq conjured (3) - 9 freq confided (3) - 3 freq coyle (3) - 53 freq censure (3) - 1 freq crude (3) - 5 freq concedes (3) - 4 freq collums (3) - 2 freq cotside (3) - 1 freq include (3) - 52 freq conduk (3) - 1 freq connae (3) - 1 freq delude (3) - 1 freq collided (3) - 4 freq |
conlude (0) - 1 freq conclude (2) - 11 freq concede (3) - 5 freq confide (3) - 4 freq cold (4) - 45 freq cowld (4) - 52 freq conrod (4) - 1 freq coulda (4) - 32 freq couled (4) - 1 freq coiled (4) - 2 freq colled (4) - 2 freq claude (4) - 1 freq conlig (4) - 2 freq dounlade (4) - 3 freq childe (4) - 1 freq couldo (4) - 1 freq conlin (4) - 5 freq conned (4) - 1 freq canle (4) - 2 freq clud (4) - 9 freq conjure (4) - 5 freq confuse (4) - 8 freq conked (4) - 1 freq concludet (4) - 1 freq consume (4) - 3 freq |
SoundEx code - C543 channelled - 2 freq cummled - 2 freq cummelled - 2 freq comhaltas - 1 freq cannel-wuid - 2 freq conlude - 1 freq chainelt - 1 freq |
MetaPhone code - KNLT kinnelt - 3 freq kennled - 2 freq kinnlt - 1 freq kennelt - 1 freq conlude - 1 freq kinnilt - 1 freq |
CONLUDE |
| Time to execute Levenshtein function - 0.198709 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.401002 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.031448 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.039350 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.000881 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. |