| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humpbacks (0) - 1 freq impacks (3) - 1 freq cutbacks (3) - 1 freq hummocks (3) - 1 freq humplock (3) - 4 freq haudbacks (3) - 1 freq cumback (3) - 1 freq humpybackit (3) - 1 freq whaalbacks (4) - 1 freq hacks (4) - 3 freq gumpick (4) - 1 freq impack (4) - 8 freq zumbas (4) - 1 freq humbugs (4) - 5 freq tailbacks (4) - 1 freq draabacks (4) - 1 freq unpack (4) - 5 freq numptics (4) - 1 freq comeback (4) - 8 freq humphers (4) - 1 freq upbraks (4) - 1 freq quacks (4) - 1 freq bumbazes (4) - 2 freq backs (4) - 95 freq mbanks (4) - 1 freq |
humpbacks (0) - 1 freq humpybackit (4) - 1 freq impacks (5) - 1 freq humplock (5) - 4 freq haudbacks (5) - 1 freq hummocks (5) - 1 freq cutbacks (6) - 1 freq cumback (6) - 1 freq macks (7) - 3 freq mudbanks (7) - 2 freq suspecks (7) - 2 freq cumnocks (7) - 1 freq snapback (7) - 1 freq humps (7) - 3 freq drawbacks (7) - 2 freq impacts (7) - 1 freq smacks (7) - 2 freq tummocks (7) - 2 freq humpie-backit (7) - 1 freq hame-bakes (7) - 1 freq humphs (7) - 2 freq placks (7) - 3 freq knapsacks (7) - 1 freq hardback (7) - 2 freq hummocky (7) - 1 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 - HMPBKS humpbacks - 1 freq |
HUMPBACKS |
| Time to execute Levenshtein function - 0.475920 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.816141 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.090039 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.102957 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.001171 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. |