| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ocbm (0) - 1 freq cbm (1) - 2 freq o'em (2) - 3 freq ecb (2) - 1 freq acum (2) - 1 freq otb (2) - 1 freq fcnm (2) - 1 freq cym (2) - 6 freq oim (2) - 14 freq oc (2) - 2 freq cem (2) - 1 freq cim (2) - 5 freq och (2) - 706 freq scam (2) - 11 freq ofcom (2) - 5 freq ocht (2) - 317 freq cam (2) - 2629 freq qcby (2) - 1 freq 'cum (2) - 4 freq 'cam (2) - 9 freq obs (2) - 1 freq oam (2) - 2 freq oi'm (2) - 1 freq jcb (2) - 2 freq com (2) - 134 freq |
ocbm (0) - 1 freq cbm (1) - 2 freq cbg (3) - 1 freq cbb (3) - 4 freq com (3) - 134 freq acrm (3) - 1 freq rbm (3) - 4 freq cam (3) - 2629 freq cfm (3) - 1 freq cbd (3) - 1 freq occam (3) - 1 freq cm (3) - 13 freq icam (3) - 1 freq cum (3) - 643 freq cim (3) - 5 freq cem (3) - 1 freq bm (3) - 5 freq cym (3) - 6 freq acum (3) - 1 freq ecb (3) - 1 freq cb (3) - 3 freq cbh (3) - 1 freq comm (4) - 2 freq caam (4) - 11 freq bmi (4) - 1 freq |
SoundEx code - O215 occupyin - 2 freq oak-beam - 1 freq occupant - 2 freq occupants - 1 freq ocbm - 1 freq |
MetaPhone code - OKBM oak-beam - 1 freq ocbm - 1 freq |
OCBM |
| Time to execute Levenshtein function - 0.184285 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.357615 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.027961 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.037597 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.000871 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. |