| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hubbleskyu (0) - 2 freq hubbelskyu (2) - 1 freq hobbles (4) - 2 freq hubble (4) - 3 freq bubbles (4) - 24 freq subtlety (5) - 4 freq huckles (5) - 1 freq rubbled (5) - 1 freq humbled (5) - 1 freq habble (5) - 2 freq hubberin (5) - 1 freq tumbles (5) - 3 freq hunnles (5) - 1 freq bubbly' (5) - 1 freq bubblen (5) - 1 freq bumbles (5) - 1 freq gibbles (5) - 1 freq jibbles (5) - 1 freq wobbles (5) - 1 freq hubbilshue (5) - 1 freq unblenkin (5) - 1 freq hobbies (5) - 8 freq fumbles (5) - 2 freq pebbles (5) - 8 freq hummles (5) - 1 freq |
hubbleskyu (0) - 2 freq hubbelskyu (2) - 1 freq hobbles (5) - 2 freq bubbles (6) - 24 freq hubble (6) - 3 freq hubbilshue (6) - 1 freq nibbles (7) - 2 freq hobbies (7) - 8 freq bibbles (7) - 1 freq bobbles (7) - 1 freq pebbles (7) - 8 freq hubbys (7) - 1 freq hibbled (7) - 1 freq shabbles (7) - 1 freq wabbles (7) - 1 freq hobbled (7) - 2 freq hubby's (7) - 1 freq cobbles (7) - 10 freq sibbles (7) - 1 freq wobbles (7) - 1 freq gibbles (7) - 1 freq habble (7) - 2 freq jibbles (7) - 1 freq hbbs (8) - 1 freq bubbliejok (8) - 1 freq |
SoundEx code - H142 howplessly - 2 freq hopeless - 12 freq hauf-licht - 6 freq hauflicht - 1 freq haiveless - 1 freq hobbles - 2 freq howplessness - 2 freq hovels - 1 freq hauf-likit - 1 freq hapless - 11 freq hopelessness - 2 freq hauf-lachin - 1 freq howpless - 5 freq hopless - 1 freq hubbleskyu - 2 freq hovel's - 1 freq hoppless - 1 freq haveless - 1 freq hafolk - 1 freq hubbelskyu - 1 freq hubbilshue - 1 freq hopelessly - 1 freq €˜hopelessly - 1 freq hauf-light - 2 freq hauf-lauchin - 1 freq hplayspiano - 1 freq |
MetaPhone code - HBLSKY hubbleskyu - 2 freq hubbelskyu - 1 freq |
HUBBLESKYU |
| Time to execute Levenshtein function - 0.367007 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.560317 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.062559 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.039251 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.000914 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. |