| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hyperbole (0) - 7 freq hypobole (2) - 1 freq hypermobile (3) - 1 freq hypernova (3) - 1 freq hyperion (3) - 1 freq merble (4) - 2 freq herbie (4) - 11 freq pebble (4) - 9 freq hercule (4) - 1 freq herbour (4) - 23 freq reperable (4) - 1 freq herbal (4) - 5 freq hyperion's (4) - 1 freq hyper (4) - 4 freq hyper-birl (4) - 2 freq herbor (4) - 1 freq herbrie (4) - 6 freq hideyhole (4) - 6 freq peeble (4) - 1 freq hyperspace (4) - 1 freq chaperone (4) - 1 freq paperboay (4) - 1 freq hyperdrive (4) - 1 freq superbly (4) - 1 freq pernee (5) - 1 freq |
hyperbole (0) - 7 freq hypobole (3) - 1 freq hypermobile (4) - 1 freq superbly (5) - 1 freq herbal (5) - 5 freq hyperion (5) - 1 freq hypernova (5) - 1 freq reperable (5) - 1 freq paperboay (6) - 1 freq peeble (6) - 1 freq hoarrible (6) - 1 freq parable (6) - 54 freq hereablo (6) - 1 freq herbrie (6) - 6 freq parabola (6) - 2 freq horrible (6) - 58 freq herbor (6) - 1 freq pebble (6) - 9 freq herbie (6) - 11 freq merble (6) - 2 freq hercule (6) - 1 freq herbour (6) - 23 freq hyper-birl (6) - 2 freq hyper (6) - 4 freq hersel (7) - 1057 freq |
SoundEx code - H161 hyperbole - 7 freq haverpokes - 2 freq hyperapology - 1 freq hover-flees - 1 freq haver-havering - 1 freq hie-profile - 1 freq hyper-birl - 2 freq hoverflies - 1 freq |
MetaPhone code - PRBL parabola - 2 freq hyperbole - 7 freq proably - 1 freq probly - 40 freq parable - 54 freq prob'ly - 1 freq problee - 1 freq |
HYPERBOLE |
| Time to execute Levenshtein function - 0.210397 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.354084 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.027393 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.038100 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.000857 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. |