| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hanbag (0) - 1 freq hanbags (1) - 1 freq handbag (1) - 21 freq hanbug (1) - 11 freq haunbag (1) - 9 freq handbeg (2) - 1 freq ratbag (2) - 2 freq handbags (2) - 2 freq bawbag (2) - 13 freq haandbag (2) - 1 freq hanfae (2) - 3 freq gasbag (2) - 1 freq hannah (2) - 10 freq hanna (2) - 11 freq hannaa (2) - 1 freq taybag (2) - 2 freq haundbag (2) - 4 freq hang (2) - 48 freq hung (3) - 159 freq anas (3) - 9 freq hinna (3) - 86 freq baobab (3) - 5 freq dunbae (3) - 2 freq sanday (3) - 13 freq alba' (3) - 1 freq |
hanbag (0) - 1 freq haunbag (1) - 9 freq hanbug (1) - 11 freq handbag (2) - 21 freq hanbags (2) - 1 freq haundbag (3) - 4 freq hang (3) - 48 freq haandbag (3) - 1 freq handbeg (3) - 1 freq hing (4) - 604 freq huang (4) - 2 freq hong (4) - 5 freq hundog (4) - 1 freq humbug (4) - 5 freq haeing (4) - 4 freq hinng (4) - 1 freq henbane (4) - 1 freq hnb (4) - 1 freq heng (4) - 4 freq haining (4) - 6 freq hanfae (4) - 3 freq hannah (4) - 10 freq bawbag (4) - 13 freq handbags (4) - 2 freq ratbag (4) - 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 - HNBK haunbag - 9 freq hanbug - 11 freq haunbuik - 2 freq hanbag - 1 freq |
HANBAG |
| Time to execute Levenshtein function - 0.225785 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.360004 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.028144 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.039424 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.000906 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. |