| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| han-pickit (0) - 1 freq henpeckit (3) - 1 freq handpicked (3) - 1 freq unpickt (4) - 1 freq hallockit (4) - 7 freq unpickin (4) - 1 freq hankit (4) - 2 freq landlockit (4) - 1 freq panickt (4) - 1 freq convickit (4) - 1 freq hauf-likit (4) - 1 freq nickit (4) - 4 freq inflickit (4) - 1 freq jaickit (4) - 16 freq pickit (4) - 80 freq panickin (4) - 3 freq halikit (4) - 1 freq fag-packet (4) - 1 freq spickit (4) - 1 freq haikit (4) - 1 freq unpackit (4) - 1 freq hackit (4) - 49 freq unpikit (4) - 1 freq hard-neckit (4) - 1 freq restrickit (5) - 5 freq |
han-pickit (0) - 1 freq henpeckit (4) - 1 freq handpicked (5) - 1 freq fag-packet (6) - 1 freq unpickt (6) - 1 freq unpackit (6) - 1 freq unpikit (7) - 1 freq hard-neckit (7) - 1 freq spickit (7) - 1 freq unexpeckit (7) - 10 freq wage-packet (7) - 1 freq pickit (7) - 80 freq oonexpeckit (7) - 2 freq haun-paintet (7) - 1 freq hackit (7) - 49 freq hankit (7) - 2 freq hauf-likit (7) - 1 freq panickt (7) - 1 freq unpickin (7) - 1 freq landlockit (7) - 1 freq hallockit (7) - 7 freq convickit (7) - 1 freq inflickit (7) - 1 freq nickit (7) - 4 freq unlockit (8) - 2 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 - HNPKT han-pickit - 1 freq henpeckit - 1 freq |
HAN-PICKIT |
| Time to execute Levenshtein function - 0.532238 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.634343 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.029205 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.039484 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.000880 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. |