| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oekl (0) - 1 freq weil (2) - 141 freq ol (2) - 5 freq dell (2) - 8 freq neal (2) - 1 freq veil (2) - 25 freq del (2) - 15 freq otel (2) - 1 freq pell (2) - 4 freq well (2) - 1429 freq lekd (2) - 1 freq weel (2) - 3975 freq beyl (2) - 2 freq seil (2) - 3 freq ell (2) - 1 freq onkil (2) - 9 freq oese (2) - 4 freq yell (2) - 57 freq rek (2) - 2 freq iek (2) - 1 freq skl (2) - 1 freq meal (2) - 130 freq efl (2) - 2 freq feul (2) - 1 freq oeht (2) - 1 freq |
oekl (0) - 1 freq kl (2) - 4 freq keil (2) - 3 freq keel (2) - 12 freq ek (3) - 6 freq noel (3) - 1 freq heal (3) - 27 freq oka (3) - 1 freq epl (3) - 9 freq fel (3) - 2 freq teal (3) - 2 freq yeil (3) - 1 freq etl (3) - 1 freq veal (3) - 2 freq meel (3) - 3 freq ook (3) - 2 freq ael (3) - 1 freq feel (3) - 1303 freq weyl (3) - 1 freq ouk (3) - 16 freq ooekk (3) - 1 freq lekly (3) - 2 freq okr (3) - 1 freq teil (3) - 4 freq ozil (3) - 1 freq |
SoundEx code - O240 ochil - 4 freq o'kelly - 4 freq o'issel - 1 freq ogle - 2 freq oslo - 11 freq 'oslo - 2 freq osla - 1 freq oogly - 2 freq ouzel - 2 freq ogl - 1 freq ousel - 1 freq oekl - 1 freq ouhqyl - 1 freq oxl - 1 freq ozil - 1 freq oakley - 1 freq ojly - 1 freq |
MetaPhone code - OKL o'kelly - 4 freq ogle - 2 freq oogly - 2 freq ogl - 1 freq oekl - 1 freq ouhqyl - 1 freq oakley - 1 freq |
OEKL |
| Time to execute Levenshtein function - 0.209063 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.360818 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.030198 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.040376 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.001019 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. |