| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hubbert (0) - 1 freq hubber (1) - 1 freq rubbert (1) - 2 freq habbert (1) - 1 freq cubberd (2) - 1 freq yabbert (2) - 1 freq hunkert (2) - 20 freq halbert (2) - 2 freq cubbart (2) - 1 freq humber (2) - 2 freq hunnert (2) - 14 freq hundert (2) - 7 freq lumbert (2) - 7 freq blubbert (2) - 1 freq habbers (2) - 1 freq rubbers (2) - 1 freq hubbered (2) - 1 freq rubber (2) - 54 freq hubberin (2) - 1 freq rubbery (2) - 7 freq hungert (2) - 39 freq hubbard (2) - 13 freq hunert (2) - 5 freq subvert (2) - 1 freq herbert (2) - 1 freq |
hubbert (0) - 1 freq habbert (1) - 1 freq rubbert (2) - 2 freq hubber (2) - 1 freq habbers (3) - 1 freq hubbard (3) - 13 freq hubbered (3) - 1 freq herbert (3) - 1 freq hubberin (3) - 1 freq cubbart (3) - 1 freq halbert (3) - 2 freq yabbert (3) - 1 freq hobbit (4) - 2 freq rubbery (4) - 7 freq rubber (4) - 54 freq hungert (4) - 39 freq subvert (4) - 1 freq hunert (4) - 5 freq hunkert (4) - 20 freq cubberd (4) - 1 freq rubbers (4) - 1 freq humber (4) - 2 freq hunnert (4) - 14 freq lumbert (4) - 7 freq hundert (4) - 7 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 - HBRT hubbard - 13 freq habbert - 1 freq hubbert - 1 freq hubbered - 1 freq |
HUBBERT |
| Time to execute Levenshtein function - 0.217185 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.433666 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.030029 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.045752 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.001178 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. |