| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ovoid (0) - 1 freq avoid (1) - 57 freq void (1) - 17 freq ovid (1) - 1 freq hoid (2) - 10 freq ostid (2) - 1 freq avodd (2) - 1 freq vodd (2) - 2 freq ovd (2) - 3 freq covid (2) - 73 freq oo'd (2) - 1 freq vod (2) - 1 freq owid (2) - 7 freq oid (2) - 1 freq ooie (2) - 1 freq droid (2) - 1 freq odoir (2) - 3 freq roid (2) - 1 freq i'void (2) - 1 freq ooir (2) - 1 freq voil (2) - 1 freq vood (2) - 2 freq voyd (2) - 2 freq vid (2) - 4 freq ootd (2) - 2 freq |
ovoid (0) - 1 freq void (1) - 17 freq ovid (1) - 1 freq avoid (1) - 57 freq vid (2) - 4 freq voyd (2) - 2 freq vood (2) - 2 freq vod (2) - 1 freq ovd (2) - 3 freq voodo (3) - 1 freq vidi (3) - 1 freq vd (3) - 2 freq ootd (3) - 2 freq yvgid (3) - 1 freq avoids (3) - 5 freq voil (3) - 1 freq devoid (3) - 7 freq voyied (3) - 1 freq vido (3) - 1 freq avodd (3) - 1 freq owid (3) - 7 freq covid (3) - 73 freq vodd (3) - 2 freq hoid (3) - 10 freq oid (3) - 1 freq |
SoundEx code - O130 obed - 27 freq 'ooft - 3 freq obitu - 1 freq obeyed - 4 freq oft - 5 freq ooaft - 2 freq oaft - 6 freq obayit - 2 freq opt - 2 freq oubit - 2 freq obayed - 2 freq €˜ooft - 1 freq ovoid - 1 freq off-beat - 1 freq oped - 1 freq oobed - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq obud - 1 freq obaida - 1 freq ooft - 5 freq owbbt - 3 freq obda - 1 freq oftea - 1 freq ooooft - 1 freq opoty - 1 freq offt - 1 freq |
MetaPhone code - OFT ought - 12 freq oaght - 1 freq 'ooft - 3 freq oft - 5 freq ooaft - 2 freq oaft - 6 freq €˜ooft - 1 freq ovoid - 1 freq €˜ought - 1 freq ovid - 1 freq ovd - 3 freq oooft - 4 freq ooft - 5 freq oftea - 1 freq ooooft - 1 freq offt - 1 freq |
OVOID |
| Time to execute Levenshtein function - 0.210316 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.367058 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.027659 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.037188 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.004049 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. |