| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cyjddzht (0) - 1 freq coddlit (4) - 1 freq cloddit (4) - 1 freq cloddet (4) - 2 freq coddilt (4) - 1 freq cuddlet (4) - 1 freq c-dicht (4) - 1 freq cluddit (4) - 1 freq couldn't (5) - 18 freq shiddert (5) - 1 freq yeht (5) - 1 freq hiddilt (5) - 1 freq hauddit (5) - 18 freq cyard (5) - 1 freq ridd-hot (5) - 1 freq buddha (5) - 16 freq jdpzu (5) - 1 freq coddle (5) - 1 freq yirdit (5) - 29 freq teddert (5) - 2 freq cledd (5) - 1 freq bydit (5) - 8 freq couldnt (5) - 1 freq clutcht (5) - 1 freq wuddit (5) - 1 freq |
cyjddzht (0) - 1 freq cuddlet (7) - 1 freq c-dicht (7) - 1 freq coddilt (7) - 1 freq cluddit (7) - 1 freq cloddet (7) - 2 freq coddlit (7) - 1 freq cloddit (7) - 1 freq ridd-hot (8) - 1 freq jeddart (8) - 2 freq cuddied (9) - 1 freq geddert (9) - 1 freq yiddish (9) - 4 freq breadtht (9) - 3 freq cloudit (9) - 1 freq cudda (9) - 2 freq credit (9) - 111 freq chocht (9) - 1 freq cjh (9) - 1 freq cuddle (9) - 25 freq cpduph (9) - 1 freq amjvdz (9) - 1 freq siddelt (9) - 1 freq sneddit (9) - 11 freq cleidit (9) - 2 freq |
SoundEx code - C232 cushie-doos - 11 freq casts - 19 freq chests - 7 freq costs - 46 freq cushats - 1 freq chastise - 1 freq chastisement - 1 freq coastguard's - 1 freq casuities - 1 freq coasts - 4 freq chest's - 2 freq castigate - 1 freq coastguairds - 1 freq 'costs - 1 freq cushat's - 1 freq chiocchetti's - 1 freq coastgaird - 1 freq costies - 8 freq choctaws - 1 freq castocks - 1 freq castaways - 1 freq costgaird - 1 freq cicadas - 1 freq chasteised - 1 freq cushiedoos - 2 freq chists - 1 freq cystic - 1 freq cactus - 2 freq cxizudkvyu - 1 freq coqxtj - 1 freq castkegate - 1 freq cjcheckouteaston - 1 freq cyjddzht - 1 freq coqwdqs - 1 freq cheesedick - 1 freq cgogdqr - 1 freq checkoutgirl - 2 freq chgtsyv - 1 freq checkoots - 1 freq |
MetaPhone code - SJTST cyjddzht - 1 freq |
CYJDDZHT |
| Time to execute Levenshtein function - 0.294622 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.512102 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.028674 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.041852 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.001112 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. |