| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humbug (0) - 5 freq humbugs (1) - 5 freq hamburg (2) - 3 freq humbie (2) - 1 freq humbly (2) - 6 freq humble (2) - 27 freq humber (2) - 2 freq pxmbug (2) - 1 freq humour (2) - 73 freq hanbug (2) - 11 freq hubby (3) - 10 freq hug (3) - 41 freq fuming (3) - 2 freq hummel (3) - 5 freq sumbudy (3) - 3 freq hummed (3) - 10 freq humpf (3) - 1 freq umber (3) - 2 freq hung (3) - 159 freq sumburgh (3) - 16 freq thumbin (3) - 3 freq 'bug (3) - 1 freq lumpur (3) - 2 freq thumbs (3) - 11 freq humerus (3) - 1 freq |
humbug (0) - 5 freq humbugs (2) - 5 freq humber (3) - 2 freq humble (3) - 27 freq hanbug (3) - 11 freq humbly (3) - 6 freq hamburg (3) - 3 freq humbie (3) - 1 freq pxmbug (4) - 1 freq lambeg (4) - 5 freq haunbag (4) - 9 freq humour (4) - 73 freq hanbag (4) - 1 freq dumbit (5) - 1 freq hubber (5) - 1 freq hbu (5) - 1 freq bug (5) - 57 freq humza (5) - 2 freq hmbbw (5) - 1 freq hubba (5) - 1 freq hubbie (5) - 1 freq hummit (5) - 1 freq humming (5) - 3 freq hummle (5) - 12 freq numbed (5) - 4 freq |
SoundEx code - H512 haunbag - 9 freq humps - 3 freq haunfast - 2 freq hembist - 1 freq hanfoos - 1 freq humphs - 2 freq henna-busks - 1 freq humfishin - 1 freq hanbug - 11 freq hame-bakes - 1 freq humbug - 5 freq haunfus - 2 freq hanfaes - 1 freq hame-bakin - 1 freq home-baked - 1 freq hinny-bees - 1 freq hampstead - 1 freq han-pickit - 1 freq hinny-piece - 1 freq hymn-books - 1 freq hempies- - 1 freq haunbuik - 2 freq hampshire - 1 freq hempies - 2 freq humfished - 1 freq humbugs - 5 freq hanbags - 1 freq hanbag - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HMK hammock - 4 freq hummocky - 1 freq humbug - 5 freq |
HUMBUG |
| Time to execute Levenshtein function - 0.398753 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.714716 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.078368 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.087061 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.000854 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. |