| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ocd (0) - 4 freq ovd (1) - 3 freq owd (1) - 1 freq odd (1) - 142 freq oct (1) - 4 freq old (1) - 178 freq oid (1) - 1 freq ock (1) - 1 freq od (1) - 8 freq cd (1) - 50 freq och (1) - 706 freq oad (1) - 2 freq o'd (1) - 13 freq xcd (1) - 1 freq ond (1) - 1 freq oc (1) - 2 freq oed (1) - 6 freq oecd (1) - 1 freq otb (2) - 1 freq bld (2) - 1 freq roid (2) - 1 freq oxo (2) - 1 freq soad (2) - 1 freq load (2) - 134 freq wcq (2) - 1 freq |
ocd (0) - 4 freq cd (1) - 50 freq oecd (1) - 1 freq oed (2) - 6 freq cood (2) - 257 freq acid (2) - 6 freq iced (2) - 14 freq acud (2) - 1 freq coud (2) - 152 freq acad (2) - 2 freq cud (2) - 955 freq cod (2) - 20 freq oc (2) - 2 freq cad (2) - 40 freq cid (2) - 25 freq och (2) - 706 freq oid (2) - 1 freq od (2) - 8 freq ock (2) - 1 freq oad (2) - 2 freq ovd (2) - 3 freq owd (2) - 1 freq oct (2) - 4 freq odd (2) - 142 freq o'd (2) - 13 freq |
SoundEx code - O230 ocht - 317 freq ought - 12 freq oaght - 1 freq 'ocht - 2 freq oozit - 2 freq oucht - 21 freq oozed - 1 freq oagit - 5 freq owsed - 9 freq ouecht - 1 freq oxide - 1 freq oecd - 1 freq oakwood - 1 freq oesed - 3 freq oct - 4 freq oosed - 1 freq ought - 1 freq oaged - 1 freq ocd - 1 freq okda - 1 freq ocd - 4 freq ojdhii - 1 freq oushed - 1 freq oqsd - 1 freq okayed - 1 freq |
MetaPhone code - OKT oecd - 1 freq oct - 4 freq ocd - 1 freq okda - 1 freq ocd - 4 freq |
OCD |
| Time to execute Levenshtein function - 0.175454 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.333680 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.031068 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.037292 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.000932 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. |