| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| handfu (0) - 10 freq hanfu (1) - 10 freq haundfu (1) - 13 freq handful (1) - 3 freq handis (2) - 1 freq handy (2) - 55 freq heedfu (2) - 1 freq hatefu (2) - 5 freq handed (2) - 49 freq handfae (2) - 2 freq handw (2) - 1 freq handle (2) - 36 freq thankfu (2) - 9 freq haundfus (2) - 3 freq myndfu (2) - 1 freq halpfu (2) - 1 freq handen (2) - 1 freq handit (2) - 27 freq hindu (2) - 8 freq hanf (2) - 2 freq handie (2) - 3 freq haunfu (2) - 8 freq handce (2) - 1 freq handee (2) - 4 freq handfoo (2) - 1 freq |
handfu (0) - 10 freq haundfu (1) - 13 freq handfae (2) - 2 freq hanfu (2) - 10 freq handful (2) - 3 freq handfoo (2) - 1 freq handee (3) - 4 freq haundful (3) - 1 freq hanf (3) - 2 freq haunfu (3) - 8 freq handce (3) - 1 freq mindfu (3) - 6 freq handin (3) - 15 freq haandfoo (3) - 1 freq hands (3) - 175 freq hindu (3) - 8 freq handel (3) - 1 freq hand (3) - 319 freq handie (3) - 3 freq handed (3) - 49 freq handit (3) - 27 freq heedfu (3) - 1 freq handy (3) - 55 freq handis (3) - 1 freq handle (3) - 36 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 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 |
HANDFU |
| Time to execute Levenshtein function - 0.180235 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.368630 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.030785 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.042171 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.000880 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. |