| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humphed (0) - 9 freq humped (1) - 2 freq humphd (1) - 1 freq mumphed (1) - 1 freq hrumphed (1) - 1 freq humphers (2) - 1 freq humph (2) - 14 freq bumped (2) - 23 freq lumped (2) - 2 freq humphy (2) - 52 freq jumped (2) - 66 freq grumphed (2) - 8 freq hummed (2) - 10 freq humpie (2) - 1 freq rumpled (2) - 2 freq humbled (2) - 1 freq thumped (2) - 5 freq humphit (2) - 1 freq hushed (2) - 10 freq humphin (2) - 17 freq dumped (2) - 21 freq hummled (2) - 1 freq humphrey (2) - 1 freq hum'led (2) - 1 freq humphs (2) - 2 freq |
humphed (0) - 9 freq humphd (1) - 1 freq hrumphed (2) - 1 freq mumphed (2) - 1 freq humped (2) - 2 freq humphy (3) - 52 freq humphs (3) - 2 freq humphin (3) - 17 freq humph (3) - 14 freq humphit (3) - 1 freq humphrey (3) - 1 freq dumped (4) - 21 freq hummled (4) - 1 freq hunched (4) - 6 freq hmph (4) - 1 freq dumpled (4) - 1 freq mumped (4) - 1 freq hum'led (4) - 1 freq pumped (4) - 15 freq lumped (4) - 2 freq bumped (4) - 23 freq hushed (4) - 10 freq humphers (4) - 1 freq grumphed (4) - 8 freq jumped (4) - 66 freq |
SoundEx code - H513 humphed - 9 freq humphd - 1 freq hamebidin - 1 freq hampden - 15 freq humpit - 1 freq humpty - 7 freq haun-fudge - 1 freq hameaboot - 1 freq hinny-pot - 1 freq humpty-dumpty - 2 freq humphit - 1 freq hame-aboot - 3 freq hempt - 1 freq haemaboot - 1 freq humped - 2 freq €œhampden - 1 freq hampdeners - 1 freq hampdenroarpod - 1 freq |
MetaPhone code - HMFT humphed - 9 freq humphd - 1 freq humphit - 1 freq |
HUMPHED |
| Time to execute Levenshtein function - 0.221170 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.367924 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.028307 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.039348 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.000828 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. |