Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
channel (0) - 41 freq chancel (1) - 1 freq hannel (1) - 1 freq channels (1) - 13 freq cannel (1) - 18 freq charnel (1) - 2 freq channel' (1) - 2 freq chanel (1) - 1 freq chantel (1) - 8 freq changey (2) - 1 freq cranned (2) - 1 freq shinnel (2) - 2 freq hannet (2) - 2 freq change' (2) - 1 freq cannea (2) - 10 freq cancel (2) - 7 freq chancer (2) - 19 freq cannels (2) - 4 freq chained (2) - 3 freq channert (2) - 3 freq cunnel (2) - 1 freq chante (2) - 1 freq chanee (2) - 1 freq chainey (2) - 1 freq shanner (2) - 1 freq |
channel (0) - 41 freq channel' (2) - 2 freq chantel (2) - 8 freq chancel (2) - 1 freq charnel (2) - 2 freq chanel (2) - 1 freq cannel (2) - 18 freq channels (2) - 13 freq hannel (2) - 1 freq chantal (3) - 1 freq hunnel (3) - 4 freq chinned (3) - 1 freq cunnel (3) - 1 freq channelin (3) - 1 freq channeluk (3) - 1 freq shinnel (3) - 2 freq chainelt (4) - 1 freq canned (4) - 2 freq cheann (4) - 1 freq chaine (4) - 6 freq phanuel (4) - 2 freq changer (4) - 3 freq chances (4) - 60 freq chance (4) - 548 freq change (4) - 308 freq |
SoundEx code - C540 chimley - 11 freq cannily - 65 freq caumly - 8 freq canle - 2 freq caunle - 26 freq canal - 27 freq chimlie - 1 freq camel - 7 freq channel - 41 freq comlie - 1 freq cunnle - 3 freq cannel - 18 freq channel' - 2 freq cannle - 7 freq chenille - 1 freq cumuli - 1 freq chanel - 1 freq cummel - 1 freq chon'll - 1 freq chon'il - 1 freq cunnel - 1 freq caunill - 1 freq cannilie - 5 freq comelie - 2 freq caumel - 1 freq caunil - 1 freq canali - 2 freq can'll - 1 freq chimla - 3 freq caunnil - 1 freq camille - 1 freq comely - 4 freq connolly - 2 freq caunel - 6 freq cawmill - 2 freq connul - 2 freq caunnle - 1 freq camilla - 2 freq connal - 1 freq connelly - 1 freq camillo - 1 freq |
MetaPhone code - XNL channel - 41 freq channel' - 2 freq shinnel - 2 freq chenille - 1 freq chanel - 1 freq chon'll - 1 freq chon'il - 1 freq |
CHANNEL |
Time to execute Levenshtein function - 0.226274 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.606508 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.060392 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.078713 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.001406 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. |