| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hummly (0) - 1 freq humbly (1) - 6 freq hummy (1) - 1 freq hummle (1) - 12 freq hummlys (1) - 1 freq hummlt (1) - 3 freq mummle (2) - 4 freq hammy (2) - 7 freq gummy (2) - 6 freq humpty (2) - 7 freq rummle (2) - 21 freq huntly (2) - 18 freq humphy (2) - 52 freq hummil (2) - 2 freq rummlt (2) - 1 freq tummy (2) - 4 freq hummed (2) - 10 freq mummy (2) - 12 freq rumbly (2) - 1 freq hummin (2) - 18 freq hummelt (2) - 2 freq homely (2) - 2 freq hugely (2) - 4 freq huily (2) - 2 freq hummled (2) - 1 freq |
hummly (0) - 1 freq hummle (1) - 12 freq hummel (2) - 5 freq hummil (2) - 2 freq hummlt (2) - 3 freq hummy (2) - 1 freq humbly (2) - 6 freq hummlys (2) - 1 freq wummily (3) - 2 freq hummelt (3) - 2 freq homely (3) - 2 freq hummled (3) - 1 freq tummle (3) - 19 freq hummles (3) - 1 freq wummle (3) - 1 freq hummin (3) - 18 freq humanly (3) - 1 freq fummle (3) - 5 freq hummit (3) - 1 freq hummer (3) - 2 freq rummle (3) - 21 freq hamely (3) - 45 freq hammy (3) - 7 freq mummle (3) - 4 freq hummels (3) - 1 freq |
SoundEx code - H540 hamelie - 2 freq hamely - 45 freq hummle - 12 freq haunle - 26 freq hunnul - 4 freq hunnel - 4 freq hunnle - 2 freq hannel - 1 freq hannile - 1 freq hannle - 5 freq hummel - 5 freq homely - 2 freq hæmlie - 1 freq hanle - 4 freq hamnle - 1 freq hummil - 2 freq henley - 1 freq haunil - 1 freq hamley - 1 freq haunnil - 1 freq haunnle - 7 freq hummly - 1 freq haunel - 3 freq haemly - 1 freq hamil - 2 freq humilie - 1 freq hanlo - 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 |
HUMMLY |
| Time to execute Levenshtein function - 0.224890 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.446778 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.027439 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.074176 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.000876 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. |