| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oval (0) - 7 freq val (1) - 34 freq oral (1) - 22 freq gva (2) - 1 freq caal (2) - 99 freq mal (2) - 2 freq vol (2) - 1 freq oman (2) - 2 freq aal (2) - 755 freq ozil (2) - 1 freq vaw (2) - 1 freq deal (2) - 190 freq deval (2) - 4 freq svpl (2) - 1 freq dal (2) - 2 freq foal (2) - 2 freq coal (2) - 132 freq oaq (2) - 1 freq 'al (2) - 3 freq vocal (2) - 9 freq qbal (2) - 1 freq izal (2) - 1 freq baal (2) - 13 freq ovey (2) - 1 freq van (2) - 159 freq |
oval (0) - 7 freq val (1) - 34 freq veal (2) - 2 freq vale (2) - 8 freq avail (2) - 12 freq yaval (2) - 1 freq vl (2) - 6 freq vol (2) - 1 freq evil (2) - 89 freq oral (2) - 22 freq vil (2) - 2 freq vail (2) - 2 freq rival (3) - 14 freq oo'l (3) - 1 freq vas (3) - 1 freq lovel (3) - 1 freq hvl (3) - 2 freq beal (3) - 3 freq seal (3) - 31 freq goal (3) - 89 freq lvl (3) - 1 freq over (3) - 335 freq ovd (3) - 3 freq avaw (3) - 5 freq oekl (3) - 1 freq |
SoundEx code - O140 oval - 7 freq ophelia - 2 freq offal - 2 freq €¦offal - 1 freq opl - 1 freq oÂ’pool - 1 freq |
MetaPhone code - OFL oval - 7 freq ophelia - 2 freq offal - 2 freq €¦offal - 1 freq |
OVAL |
| Time to execute Levenshtein function - 0.166595 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.317713 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.027274 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.036477 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.000781 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. |