| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxide (0) - 1 freq oxides (1) - 1 freq pride (2) - 168 freq olive (2) - 16 freq abide (2) - 15 freq odige (2) - 1 freq elide (2) - 1 freq dioxide (2) - 2 freq iside (2) - 1 freq saide (2) - 5 freq side (2) - 1229 freq exude (2) - 4 freq opine (2) - 1 freq ovine (2) - 1 freq snide (2) - 3 freq owid (2) - 7 freq onside (2) - 2 freq boxie (2) - 21 freq ride (2) - 69 freq oxi (2) - 2 freq 'side (2) - 1 freq oid (2) - 1 freq maide (2) - 46 freq wide (2) - 248 freq ovid (2) - 1 freq |
oxide (0) - 1 freq axude (2) - 1 freq exude (2) - 4 freq oxides (2) - 1 freq xd (3) - 4 freq guide (3) - 91 freq dide (3) - 2 freq olde (3) - 1 freq axd (3) - 1 freq yxd (3) - 1 freq tide (3) - 118 freq aside (3) - 473 freq ode (3) - 13 freq hide (3) - 186 freq exile (3) - 20 freq aide (3) - 1 freq pide (3) - 1 freq ixd (3) - 1 freq gide (3) - 1 freq ovid (3) - 1 freq bide (3) - 829 freq oxsie (3) - 1 freq axed (3) - 81 freq ide (3) - 3 freq saide (3) - 5 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 - OKST oxide - 1 freq oqsd - 1 freq |
OXIDE |
| Time to execute Levenshtein function - 0.305614 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.442411 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.060195 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.039407 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.000964 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. |