| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haundfast (0) - 1 freq haunfast (1) - 2 freq haund-fest (2) - 1 freq haundfus (2) - 3 freq haundet (3) - 4 freq haundful (3) - 1 freq haundles (3) - 2 freq haundit (3) - 63 freq haurdest (3) - 1 freq hauf-past (3) - 7 freq haunfus (3) - 2 freq handwash (3) - 1 freq hauf-mast (3) - 3 freq haundrail (3) - 1 freq haundfu (3) - 13 freq handfae (3) - 2 freq haunders (3) - 1 freq handcart (3) - 1 freq haunds (3) - 234 freq haunfae (3) - 9 freq holdfast (3) - 5 freq haundless (3) - 1 freq handfastin (3) - 1 freq haundbag (3) - 4 freq haunfa (3) - 1 freq |
haundfast (0) - 1 freq haunfast (2) - 2 freq haundfus (3) - 3 freq haund-fest (3) - 1 freq handfastin (4) - 1 freq holdfast (4) - 5 freq haunds (5) - 234 freq hindmost (5) - 1 freq haunders (5) - 1 freq haundet (5) - 4 freq haundless (5) - 1 freq haundles (5) - 2 freq haundful (5) - 1 freq handfae (5) - 2 freq handcart (5) - 1 freq hindmaist (5) - 16 freq haundfu (5) - 13 freq haundit (5) - 63 freq haunfus (5) - 2 freq haurdest (5) - 1 freq handwash (5) - 1 freq hundert (6) - 7 freq hidmast (6) - 11 freq haands (6) - 43 freq manifest (6) - 6 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 - HNTFST haund-fest - 1 freq haundfast - 1 freq |
HAUNDFAST |
| Time to execute Levenshtein function - 0.244191 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.401958 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.027354 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.038119 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.000933 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. |