| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| occam (0) - 1 freq occa (1) - 1 freq ccwm (2) - 3 freq clam (2) - 10 freq oncum (2) - 50 freq oriam (2) - 1 freq ocean (2) - 63 freq cam (2) - 2618 freq sclam (2) - 1 freq icam (2) - 1 freq oercam (2) - 1 freq 'cam (2) - 9 freq €˜cam (2) - 1 freq caam (2) - 11 freq mccaw (2) - 12 freq scam (2) - 11 freq ootcam (2) - 3 freq occur (2) - 7 freq orcas (2) - 5 freq ocna (2) - 1 freq oam (2) - 2 freq outcam (2) - 1 freq ogham (2) - 2 freq incam (2) - 3 freq ocbm (2) - 1 freq |
occam (0) - 1 freq occa (2) - 1 freq outcam (3) - 1 freq occur (3) - 7 freq scam (3) - 11 freq ocbm (3) - 1 freq ootcam (3) - 3 freq becam (3) - 97 freq sccm (3) - 1 freq hccm (3) - 1 freq cram (3) - 2 freq caam (3) - 11 freq ofcom (3) - 5 freq incam (3) - 3 freq cam (3) - 2618 freq icam (3) - 1 freq ccwm (3) - 3 freq clam (3) - 10 freq oncum (3) - 50 freq oercam (3) - 1 freq 'cam (3) - 9 freq becom (4) - 1 freq scma (4) - 3 freq ccea (4) - 1 freq caim (4) - 57 freq |
SoundEx code - O250 ocean - 63 freq ochone - 13 freq oozin - 3 freq owsen - 3 freq oxen - 2 freq ocna - 1 freq 'ochone - 1 freq oagin - 6 freq oshin - 1 freq oggimai - 1 freq ochon - 1 freq ogham - 2 freq €˜ocean - 2 freq oesin - 1 freq occam - 1 freq osnu - 1 freq oÂ’some - 1 freq ookin - 1 freq oqm - 1 freq |
MetaPhone code - OKKM occam - 1 freq |
OCCAM |
| Time to execute Levenshtein function - 0.191227 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.342130 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.028297 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.037899 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.000842 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. |