| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hyperspace (0) - 1 freq cyberspace (2) - 2 freq fleerspace (3) - 1 freq persuade (4) - 17 freq persiane (4) - 1 freq heidspace (4) - 1 freq myspace (4) - 1 freq airspace (4) - 1 freq hye-shade (4) - 2 freq haversack (4) - 1 freq hyperdrive (4) - 1 freq aerospace (4) - 1 freq hyperbole (4) - 7 freq hypermobile (5) - 1 freq perce (5) - 1 freq perswaad (5) - 1 freq openslae (5) - 2 freq aftershave (5) - 4 freq peace (5) - 269 freq yersail (5) - 1 freq impersonate (5) - 1 freq shepe-skane (5) - 1 freq sperse (5) - 1 freq persian (5) - 3 freq hersael (5) - 1 freq |
hyperspace (0) - 1 freq cyberspace (4) - 2 freq fleerspace (5) - 1 freq airspace (6) - 1 freq aerospace (6) - 1 freq heidspace (6) - 1 freq hospice (7) - 6 freq hyperbole (7) - 7 freq hyperdrive (7) - 1 freq pursuance (7) - 2 freq flurespace (7) - 1 freq persiane (7) - 1 freq myspace (7) - 1 freq haversack (7) - 1 freq persuade (7) - 17 freq heidrace (8) - 1 freq hershaw (8) - 15 freq localspace (8) - 1 freq oerspoke (8) - 1 freq hyperion (8) - 1 freq hairspray (8) - 4 freq hypernova (8) - 1 freq hypsaea (8) - 1 freq prospeck (8) - 6 freq prospect (8) - 23 freq |
SoundEx code - H162 havers - 35 freq haivers - 32 freq hey-forks - 1 freq heifers - 4 freq 'havers - 1 freq 'haivers - 4 freq hubris - 1 freq hauf-price - 2 freq haufers - 4 freq habbers - 1 freq hyperspace - 1 freq hovers - 3 freq hoover's - 1 freq hypercorrection - 3 freq €œhavers - 2 freq hypercorrect - 1 freq hyper-cranreuch - 1 freq hubristic - 1 freq hypersensitive - 1 freq haversack - 1 freq hprjx - 1 freq haiversblog - 1 freq heffers - 1 freq heefers - 1 freq hippyrockchick - 12 freq hburgh - 1 freq hauf-ersed - 1 freq |
MetaPhone code - PRSPS press-ups - 1 freq precipice - 3 freq hyperspace - 1 freq |
HYPERSPACE |
| Time to execute Levenshtein function - 0.377860 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.732058 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.080686 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.037259 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.000932 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. |