| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humphy-backit (0) - 6 freq humfy-backit (2) - 1 freq humpybackit (2) - 1 freq humphie-backit (2) - 1 freq humpie-backit (2) - 1 freq humphie-back (4) - 1 freq humpbacks (5) - 1 freq hallyrackit (6) - 1 freq cuddy-back (6) - 1 freq lingel-backit (6) - 1 freq blae-backit (6) - 1 freq humphit (6) - 1 freq boolie-backit (6) - 1 freq unpackit (6) - 1 freq braid-backit (6) - 1 freq fuhl-back's (6) - 1 freq ticht-packit (6) - 1 freq hame-bakin (6) - 1 freq pernyackit (7) - 1 freq hallierackit (7) - 5 freq haillerackit (7) - 2 freq home-baked (7) - 1 freq peyback (7) - 1 freq sticky-backs (7) - 1 freq humphy (7) - 52 freq |
humphy-backit (0) - 6 freq humphie-backit (2) - 1 freq humpie-backit (3) - 1 freq humpybackit (4) - 1 freq humfy-backit (4) - 1 freq humphie-back (5) - 1 freq humpbacks (8) - 1 freq braid-backit (10) - 1 freq hame-bakin (10) - 1 freq boolie-backit (10) - 1 freq humphit (10) - 1 freq blae-backit (10) - 1 freq lingel-backit (10) - 1 freq heich-bendit (11) - 2 freq han-pickit (11) - 1 freq haud-me-back (11) - 1 freq hard-neckit (11) - 1 freq sma-boukit (11) - 2 freq homophobic (11) - 3 freq humplock (11) - 4 freq humpty-dumpty (11) - 2 freq paper-back (11) - 1 freq hame-bakes (11) - 1 freq heech-kickin (11) - 1 freq unpackit (11) - 1 freq |
SoundEx code - H511 humphie-back - 1 freq humfy-backit - 1 freq humphy-backit - 6 freq humpie-backit - 1 freq haunbuffed - 1 freq humphie-backit - 1 freq humpybackit - 1 freq homophobic - 3 freq homophobe - 1 freq |
MetaPhone code - HMFBKT humfy-backit - 1 freq humphy-backit - 6 freq humphie-backit - 1 freq |
HUMPHY-BACKIT |
| Time to execute Levenshtein function - 0.199036 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.380755 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.026795 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.036619 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.000830 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. |