| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chop-chop (0) - 1 freq chopchop (1) - 1 freq chap-chap (2) - 1 freq chipshop (3) - 1 freq chip-shoap (3) - 1 freq hip-hop (3) - 1 freq photoshop (4) - 1 freq cop-oot (4) - 1 freq hiphop (4) - 1 freq ho-ho (4) - 9 freq choocher (4) - 1 freq chung-chou (4) - 1 freq 'ho-ho (4) - 4 freq chocht (4) - 1 freq clip--clop (4) - 1 freq chooch (4) - 1 freq co-op (4) - 15 freq chincher (5) - 4 freq hotched (5) - 2 freq thoche (5) - 1 freq ho-ho's (5) - 1 freq cheuch (5) - 2 freq ho-bo (5) - 1 freq coal-cowp (5) - 1 freq cocoon (5) - 2 freq |
chop-chop (0) - 1 freq chap-chap (2) - 1 freq chopchop (2) - 1 freq chip-shoap (4) - 1 freq hip-hop (5) - 1 freq chipshop (5) - 1 freq clip--clop (7) - 1 freq chooch (7) - 1 freq ship-shape (7) - 1 freq chocht (7) - 1 freq chung-chou (7) - 1 freq choocher (7) - 1 freq hiphop (7) - 1 freq church (8) - 75 freq catchup (8) - 1 freq churches (8) - 12 freq 'nae-chap (8) - 1 freq hap-nap (8) - 1 freq 'chook-chook (8) - 1 freq cahoutchy (8) - 1 freq corpach (8) - 1 freq chyaach (8) - 1 freq chacha (8) - 1 freq cheenchis (8) - 2 freq choppie (8) - 6 freq |
SoundEx code - C121 chap-chap-chap - 1 freq cube-shapit - 1 freq chipshop - 1 freq chap-chap-chappin - 2 freq cube-shaped - 1 freq chop-chop - 1 freq coffeespuins - 1 freq chap-chap - 1 freq chip-shoap - 1 freq ckepukupjs - 1 freq chopchop - 1 freq cvxevqaf - 1 freq cfvbgaph - 1 freq cxfqsofi - 1 freq cxspgfgz - 1 freq ckvxv - 1 freq cowboysbabygurl - 1 freq |
MetaPhone code - XPXP chipshop - 1 freq ship-shape - 1 freq chop-chop - 1 freq chap-chap - 1 freq chip-shoap - 1 freq chopchop - 1 freq |
CHOP-CHOP |
| Time to execute Levenshtein function - 0.262845 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.389250 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.028521 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.037037 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.000933 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. |