| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chuspa (0) - 1 freq cusa (2) - 1 freq chuse (2) - 9 freq chufa (2) - 1 freq cusp (2) - 3 freq cuppa (2) - 21 freq chuva (2) - 1 freq chusin (2) - 4 freq chippa (2) - 1 freq husna (2) - 1 freq chusit (2) - 1 freq chuza (2) - 2 freq chusen (2) - 2 freq thusa (2) - 1 freq cudda (3) - 2 freq cous (3) - 1 freq hesp (3) - 1 freq coupan (3) - 1 freq thuma (3) - 1 freq chug (3) - 2 freq china (3) - 53 freq chunce (3) - 82 freq hussy (3) - 2 freq lhasa (3) - 1 freq cheeps (3) - 2 freq |
chuspa (0) - 1 freq chusit (3) - 1 freq chusen (3) - 2 freq chusin (3) - 4 freq chippa (3) - 1 freq chuse (3) - 9 freq cusp (3) - 3 freq chirp (4) - 2 freq hasp (4) - 2 freq choss (4) - 2 freq chese (4) - 1 freq choppy (4) - 6 freq chase (4) - 51 freq chisty (4) - 1 freq colspy (4) - 1 freq chaip (4) - 15 freq cheyp (4) - 1 freq chirpy (4) - 3 freq chase' (4) - 1 freq chases (4) - 7 freq hosp (4) - 1 freq chis (4) - 2 freq chasie (4) - 1 freq chaser (4) - 9 freq chose (4) - 62 freq |
SoundEx code - C210 chequep - 1 freq cusp - 3 freq cosby - 1 freq check-up - 1 freq cohesive - 9 freq chekhov - 1 freq coycfuu - 1 freq cisab - 1 freq cokvi - 1 freq chickpea - 1 freq ccyaoksubb - 1 freq chuspa - 1 freq cikup - 1 freq cjisf - 1 freq |
MetaPhone code - XSP chuspa - 1 freq |
CHUSPA |
| Time to execute Levenshtein function - 0.411699 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.550302 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.062603 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.040370 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.000931 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. |