| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ouhqyl (0) - 1 freq outty (3) - 2 freq oqy (3) - 1 freq fuhl (3) - 1 freq ouh (3) - 1 freq hayl (3) - 2 freq outby (3) - 20 freq buhl (3) - 17 freq oyl (3) - 2 freq oursel (3) - 2 freq ochil (3) - 4 freq oudey (3) - 1 freq suql (3) - 1 freq oul (3) - 338 freq quhy (3) - 2 freq puhl (3) - 1 freq outbye (3) - 10 freq oihyr (3) - 1 freq quhyt (3) - 5 freq ouzel (3) - 2 freq hwyl (3) - 1 freq oohya (3) - 1 freq quhill (3) - 1 freq outlol (3) - 1 freq ousel (3) - 1 freq |
ouhqyl (0) - 1 freq suql (4) - 1 freq hayl (4) - 2 freq hwyl (4) - 1 freq hqv (5) - 1 freq oaohl (5) - 1 freq hyll (5) - 1 freq hul (5) - 6 freq holl (5) - 5 freq tql (5) - 1 freq harl (5) - 5 freq hurl (5) - 64 freq ayqal (5) - 1 freq hol (5) - 11 freq mql (5) - 1 freq hull (5) - 30 freq jql (5) - 1 freq hqt (5) - 1 freq huily (5) - 2 freq hvl (5) - 2 freq hurly (5) - 4 freq hell (5) - 375 freq huil (5) - 3 freq hl (5) - 1 freq ahill (5) - 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 |
OUHQYL |
| Time to execute Levenshtein function - 0.219214 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.350444 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.032708 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.040267 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.000861 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. |