| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humble (0) - 26 freq hubble (1) - 3 freq rumble (1) - 8 freq tumble (1) - 9 freq humbly (1) - 6 freq humbled (1) - 1 freq bumble (1) - 2 freq hummle (1) - 12 freq humbie (1) - 1 freq mumble (1) - 2 freq rumblet (2) - 1 freq hurple (2) - 1 freq humilie (2) - 1 freq hummlt (2) - 3 freq humblin (2) - 1 freq hume (2) - 10 freq ramble (2) - 2 freq jummle (2) - 5 freq rubble (2) - 7 freq dubble (2) - 2 freq bumbee (2) - 4 freq mumbled (2) - 6 freq amble (2) - 2 freq rumbles (2) - 3 freq fumbles (2) - 2 freq |
humble (0) - 26 freq humbly (1) - 6 freq hummle (2) - 12 freq humbie (2) - 1 freq bumble (2) - 2 freq mumble (2) - 2 freq hubble (2) - 3 freq humbled (2) - 1 freq rumble (2) - 8 freq tumble (2) - 9 freq rumbly (3) - 1 freq habble (3) - 2 freq humbug (3) - 5 freq hamnle (3) - 1 freq hummly (3) - 1 freq amble (3) - 2 freq thimble (3) - 13 freq wimble (3) - 1 freq gamble (3) - 12 freq nimble (3) - 1 freq humber (3) - 2 freq ramble (3) - 2 freq humilie (3) - 1 freq humblin (3) - 1 freq cumbie (4) - 1 freq |
SoundEx code - H514 humble - 26 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 - 26 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 |
HUMBLE |
| Time to execute Levenshtein function - 0.210088 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.401438 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.028135 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.037055 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.000916 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. |