| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zczofm (0) - 1 freq vuzcfm (3) - 1 freq co'm (3) - 1 freq com (3) - 134 freq coum (3) - 2 freq scoom (3) - 2 freq comm (3) - 2 freq zoom (3) - 19 freq rczrim (3) - 1 freq coff (3) - 19 freq croft (3) - 53 freq ziofx (3) - 1 freq scoofs (3) - 1 freq kczoe (3) - 1 freq schofe (3) - 6 freq coof (3) - 7 freq cfm (3) - 1 freq scoof (3) - 1 freq coft (3) - 9 freq scoff (3) - 12 freq coofs (3) - 5 freq coof's (4) - 1 freq choke (4) - 23 freq chowe (4) - 4 freq cots (4) - 2 freq |
zczofm (0) - 1 freq vuzcfm (5) - 1 freq cfm (5) - 1 freq rczrim (5) - 1 freq kczoe (6) - 1 freq schofe (6) - 6 freq coft (6) - 9 freq coofs (6) - 5 freq scoff (6) - 12 freq scoofs (6) - 1 freq scoof (6) - 1 freq coof (6) - 7 freq coum (6) - 2 freq com (6) - 134 freq ziofx (6) - 1 freq co'm (6) - 1 freq comm (6) - 2 freq scoom (6) - 2 freq croft (6) - 53 freq coff (6) - 19 freq zoom (6) - 19 freq ecz (7) - 1 freq culfs (7) - 2 freq calm (7) - 133 freq czars (7) - 2 freq |
SoundEx code - Z150 zephaniah - 3 freq zczofm - 1 freq zbma - 1 freq |
MetaPhone code - SKSFM zczofm - 1 freq |
ZCZOFM |
| Time to execute Levenshtein function - 0.508591 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.757654 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.029031 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.040655 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.000858 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. |