| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| handfae (0) - 2 freq hanfae (1) - 3 freq handbag (2) - 21 freq handful (2) - 3 freq handie (2) - 3 freq hadnae (2) - 186 freq haanfae (2) - 6 freq handee (2) - 4 freq haednae (2) - 8 freq haunfae (2) - 9 freq handle (2) - 36 freq handfoo (2) - 1 freq hanfaes (2) - 1 freq andrae (2) - 7 freq handce (2) - 1 freq thankfae (2) - 1 freq handkie (2) - 1 freq handfu (2) - 10 freq handmade (2) - 2 freq shadae (3) - 1 freq fandan (3) - 7 freq hanuman (3) - 1 freq hidtae (3) - 4 freq hunda (3) - 1 freq haddie (3) - 9 freq |
handfae (0) - 2 freq hanfae (2) - 3 freq handfu (2) - 10 freq handfoo (2) - 1 freq handle (3) - 36 freq handkie (3) - 1 freq haundfu (3) - 13 freq haandfoo (3) - 1 freq haunfae (3) - 9 freq handce (3) - 1 freq handful (3) - 3 freq handie (3) - 3 freq haanfae (3) - 6 freq handee (3) - 4 freq hendrie (4) - 1 freq handen (4) - 1 freq haunfa (4) - 1 freq handit (4) - 27 freq handw (4) - 1 freq haandle (4) - 2 freq handel (4) - 1 freq handier (4) - 1 freq haundle (4) - 9 freq haundie (4) - 1 freq hunde (4) - 1 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 - HNTF haundfu - 13 freq handfu - 10 freq haandfoo - 1 freq handfae - 2 freq handfoo - 1 freq |
HANDFAE |
| Time to execute Levenshtein function - 0.194763 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.370769 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.028276 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.044161 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.001242 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. |