| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haundbuik (0) - 1 freq haunbuik (1) - 2 freq haundbook (2) - 1 freq haundiwirk (3) - 1 freq sangbuik (3) - 1 freq haundrail (3) - 1 freq haundywurk (3) - 1 freq haundin (3) - 18 freq haundfus (3) - 3 freq haundit (3) - 63 freq haundie (3) - 1 freq handbook (3) - 1 freq haundbag (3) - 4 freq haundfu (3) - 13 freq haundful (3) - 1 freq haundlin (3) - 10 freq handie (4) - 3 freq haundlins (4) - 1 freq haunded (4) - 30 freq andback (4) - 1 freq haudbacks (4) - 1 freq haundy (4) - 18 freq laundit (4) - 11 freq haunlin (4) - 5 freq haudit (4) - 42 freq |
haundbuik (0) - 1 freq haundbook (2) - 1 freq haunbuik (2) - 2 freq handbook (3) - 1 freq haundbag (4) - 4 freq haundful (5) - 1 freq haundfu (5) - 13 freq handkie (5) - 1 freq haandbag (5) - 1 freq handbeg (5) - 1 freq handbag (5) - 21 freq handbrake (5) - 3 freq haundlin (5) - 10 freq haundie (5) - 1 freq haundrail (5) - 1 freq sangbuik (5) - 1 freq haundiwirk (5) - 1 freq haundin (5) - 18 freq haundywurk (5) - 1 freq haundit (5) - 63 freq haundfus (5) - 3 freq haundshake (6) - 1 freq haandin (6) - 1 freq haundle (6) - 9 freq hardback (6) - 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 |
HAUNDBUIK |
| Time to execute Levenshtein function - 0.253247 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.456113 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.031173 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.040838 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.000958 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. |