| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxides (0) - 1 freq oxide (1) - 1 freq slides (2) - 8 freq glides (2) - 5 freq boxies (2) - 4 freq oiles (2) - 1 freq odes (2) - 5 freq ooies (2) - 1 freq hides (2) - 14 freq 'ides (2) - 1 freq poxies (2) - 1 freq heides (2) - 1 freq olives (2) - 17 freq exudes (2) - 2 freq 'sides (2) - 1 freq dides (2) - 1 freq brides (2) - 3 freq tides (2) - 22 freq guides (2) - 15 freq rides (2) - 16 freq exiles (2) - 4 freq bides (2) - 230 freq asides (2) - 8 freq sides (2) - 155 freq owider (2) - 1 freq |
oxides (0) - 1 freq exudes (2) - 2 freq oxide (2) - 1 freq guides (3) - 15 freq tides (3) - 22 freq dides (3) - 1 freq rides (3) - 16 freq bides (3) - 230 freq abides (3) - 5 freq asides (3) - 8 freq exodus (3) - 6 freq exiles (3) - 4 freq sides (3) - 155 freq odes (3) - 5 freq 'ides (3) - 1 freq hides (3) - 14 freq heides (3) - 1 freq ruids (4) - 4 freq leids (4) - 466 freq xmds (4) - 1 freq fuids (4) - 2 freq godes (4) - 2 freq odds (4) - 91 freq maids (4) - 14 freq axude (4) - 1 freq |
SoundEx code - O232 okiedokie - 1 freq octogenarian - 1 freq 'okaydoky - 1 freq okay-dokay - 1 freq oxides - 1 freq ostaig - 2 freq octogenarians - 1 freq ochts - 3 freq oxdzo - 1 freq ouexutjyau - 1 freq owstqem - 1 freq oxytocin - 1 freq okdaqszwvz - 1 freq ojtijtxvg - 1 freq ocht's - 1 freq |
MetaPhone code - OKSTS oxides - 1 freq oxdzo - 1 freq |
OXIDES |
| Time to execute Levenshtein function - 0.262726 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.500427 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.029833 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.042965 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.000939 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. |