| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ogle (0) - 2 freq ogre (1) - 1 freq ole (1) - 2 freq ogl (1) - 1 freq bogle (1) - 45 freq oyle (1) - 3 freq gle (1) - 4 freq onlie (2) - 102 freq syle (2) - 6 freq gla (2) - 1 freq pyle (2) - 2 freq yle (2) - 2 freq ouse (2) - 1 freq agee (2) - 1 freq goggle (2) - 1 freq vogie (2) - 3 freq oil- (2) - 1 freq olr (2) - 2 freq foogle (2) - 1 freq mlle (2) - 1 freq eggle (2) - 2 freq hale (2) - 965 freq bodle (2) - 3 freq rogue (2) - 11 freq male (2) - 59 freq |
ogle (0) - 2 freq ogl (1) - 1 freq gle (1) - 4 freq ogre (2) - 1 freq aglee (2) - 1 freq ugly (2) - 74 freq eagle (2) - 20 freq glie (2) - 1 freq gly (2) - 1 freq agile (2) - 2 freq glue (2) - 20 freq gl (2) - 2 freq glee (2) - 30 freq aigle (2) - 4 freq glu (2) - 1 freq oyle (2) - 3 freq bogle (2) - 45 freq ole (2) - 2 freq gale (2) - 64 freq gla (2) - 1 freq agley (2) - 44 freq oogly (2) - 2 freq gul (3) - 4 freq gye (3) - 194 freq oagre (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 |
OGLE |
| Time to execute Levenshtein function - 0.202247 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.329943 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.029349 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.038589 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.001256 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. |