| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humbly (0) - 6 freq hummly (1) - 1 freq rumbly (1) - 1 freq humble (1) - 27 freq hurly (2) - 4 freq humbug (2) - 5 freq bumble (2) - 2 freq huntly (2) - 29 freq humber (2) - 2 freq humbled (2) - 1 freq tumblt (2) - 2 freq tumble (2) - 9 freq hummle (2) - 12 freq hubby (2) - 10 freq humpty (2) - 7 freq crumbly (2) - 2 freq publy (2) - 1 freq hugely (2) - 4 freq humbie (2) - 1 freq hamely (2) - 45 freq mumble (2) - 3 freq bubbly (2) - 10 freq hummlys (2) - 1 freq hummy (2) - 1 freq hubble (2) - 3 freq |
humbly (0) - 6 freq humble (1) - 27 freq hummly (2) - 1 freq rumbly (2) - 1 freq hubble (3) - 3 freq mumble (3) - 3 freq hamely (3) - 45 freq humblin (3) - 1 freq homely (3) - 2 freq humanly (3) - 1 freq rumble (3) - 9 freq fumble (3) - 1 freq humbie (3) - 1 freq humber (3) - 2 freq humbug (3) - 5 freq bumble (3) - 2 freq humbled (3) - 1 freq hummle (3) - 12 freq tumble (3) - 9 freq chimbley (4) - 1 freq nimble (4) - 1 freq embla (4) - 2 freq hamley (4) - 1 freq gamble (4) - 13 freq hamil (4) - 2 freq |
SoundEx code - H514 humble - 27 freq humplock - 4 freq hinnie-blobs - 2 freq humbly - 6 freq humblin - 1 freq haemophilus - 1 freq hinnie--blobs - 1 freq haunful - 1 freq haunbell - 1 freq hmflzdn - 1 freq humbled - 1 freq hannaflint - 1 freq hannibal - 1 freq henbell - 2 freq humbling - 1 freq |
MetaPhone code - HML humble - 27 freq hamelie - 2 freq hamely - 45 freq hummle - 12 freq humbly - 6 freq hummel - 5 freq homely - 2 freq hummil - 2 freq hamley - 1 freq hummly - 1 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq |
HUMBLY |
| Time to execute Levenshtein function - 0.214587 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.384912 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.027046 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.037471 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.000945 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. |