| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| handbag (0) - 21 freq haandbag (1) - 1 freq handbeg (1) - 1 freq haundbag (1) - 4 freq handbags (1) - 2 freq hanbag (1) - 1 freq hanbug (2) - 11 freq handing (2) - 2 freq sandrag (2) - 1 freq handfae (2) - 2 freq hanbags (2) - 1 freq haunbag (2) - 9 freq windbag (2) - 2 freq handily (3) - 1 freq and-aa (3) - 1 freq handful (3) - 3 freq handen (3) - 1 freq ratbag (3) - 2 freq hannibal (3) - 1 freq bean-bag (3) - 1 freq handlin (3) - 1 freq handicap (3) - 2 freq hand's (3) - 2 freq handis (3) - 1 freq hand (3) - 319 freq |
handbag (0) - 21 freq haandbag (1) - 1 freq haundbag (1) - 4 freq handbeg (1) - 1 freq hanbag (2) - 1 freq handbags (2) - 2 freq windbag (3) - 2 freq haunbag (3) - 9 freq hanbug (3) - 11 freq handing (3) - 2 freq sandrag (4) - 1 freq handfae (4) - 2 freq hanbags (4) - 1 freq hundog (4) - 1 freq handbook (4) - 1 freq handit (5) - 27 freq landing (5) - 11 freq handw (5) - 1 freq ardbeg (5) - 1 freq hands (5) - 175 freq andalg (5) - 1 freq handled (5) - 7 freq handler (5) - 1 freq hang (5) - 48 freq handmade (5) - 2 freq |
SoundEx code - H531 haund-fest - 1 freq handbag - 21 freq haund-for-haund - 2 freq haundbag - 4 freq haematopus - 1 freq handbeg - 1 freq haundbuik - 1 freq haundfus - 3 freq haundfu - 13 freq handful - 3 freq handfu - 10 freq handwoven - 1 freq haund-wuiven - 1 freq haundbook - 1 freq handbrake - 3 freq haandfoo - 1 freq haandbag - 1 freq handfastin - 1 freq haundfast - 1 freq handfae - 2 freq haund-for-nieve - 1 freq handbags - 2 freq haundful - 1 freq handfoo - 1 freq handbook - 1 freq hannothehibbie - 1 freq handpicked - 1 freq |
MetaPhone code - HNTBK handbag - 21 freq haundbag - 4 freq handbeg - 1 freq haundbuik - 1 freq haundbook - 1 freq haandbag - 1 freq handbook - 1 freq |
HANDBAG |
| Time to execute Levenshtein function - 0.180633 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.339803 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.027347 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.037173 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.000895 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. |