| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hyperdrive (0) - 1 freq owerdrive (3) - 2 freq overdrive (3) - 7 freq herbrie (4) - 6 freq hendrie (4) - 1 freq hyper-birl (4) - 2 freq herrie (4) - 2 freq hyperspace (4) - 1 freq hyperbole (4) - 7 freq hoursdrive (4) - 1 freq hypocrite (4) - 4 freq hyperion (4) - 1 freq hypermobile (4) - 1 freq perceive (4) - 3 freq hypernova (4) - 1 freq imperative (4) - 8 freq perrie (4) - 1 freq headline (5) - 10 freq haurdlie (5) - 9 freq cooperative (5) - 1 freq €˜peedie (5) - 1 freq heydrich (5) - 7 freq heidie (5) - 70 freq gaerdie (5) - 1 freq herdins (5) - 3 freq |
hyperdrive (0) - 1 freq owerdrive (5) - 2 freq overdrive (5) - 7 freq hoursdrive (6) - 1 freq hypernova (6) - 1 freq perceive (7) - 3 freq imperative (7) - 8 freq hypermobile (7) - 1 freq owredryve (7) - 1 freq hairdrier (7) - 1 freq perrie (7) - 1 freq hippodrome (7) - 2 freq hyper-birl (7) - 2 freq herbrie (7) - 6 freq hendrie (7) - 1 freq herrie (7) - 2 freq hyperion (7) - 1 freq hypocrite (7) - 4 freq hyperbole (7) - 7 freq hyperspace (7) - 1 freq hairdlie (8) - 2 freq preserve (8) - 20 freq hendrix (8) - 2 freq bardrie (8) - 1 freq harperrig (8) - 1 freq |
SoundEx code - H163 hubbard - 13 freq habbert - 1 freq hauf-roads - 7 freq hubbert - 1 freq hauf-feart - 2 freq havert - 1 freq hebridean - 2 freq hauf-hairtedly - 1 freq hoovered - 4 freq havered - 7 freq hebrides - 14 freq hauf-heartedly - 1 freq hovered - 11 freq hypertensed - 1 freq haavert - 1 freq hauf-heard - 1 freq hybrid - 4 freq hyperdrive - 1 freq haivered - 2 freq hauf-hertit - 1 freq hubbered - 1 freq hauf-brither - 2 freq hauf-hertidly - 1 freq hauf-wrutten - 1 freq hybridisation - 3 freq hebrideanbloss - 4 freq hebrideanrefurb - 1 freq |
MetaPhone code - PRTRF hyperdrive - 1 freq |
HYPERDRIVE |
| Time to execute Levenshtein function - 0.213047 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.372727 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.029765 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.038256 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.000872 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. |