| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| handful (0) - 3 freq haundful (1) - 1 freq handfu (1) - 10 freq handfae (2) - 2 freq hanfu (2) - 10 freq haundfus (2) - 3 freq harmful (2) - 1 freq handfoo (2) - 1 freq handsel (2) - 7 freq thankful (2) - 11 freq handel (2) - 1 freq mindful (2) - 5 freq haundfu (2) - 13 freq handsum (2) - 1 freq haunful (2) - 1 freq heidful (2) - 1 freq hateful (2) - 4 freq hand-out (3) - 1 freq handlin (3) - 1 freq sandal (3) - 1 freq handers (3) - 1 freq faerful (3) - 2 freq hayvul (3) - 1 freq artful (3) - 2 freq aaful (3) - 2 freq |
handful (0) - 3 freq haundful (1) - 1 freq handfu (2) - 10 freq haundfu (3) - 13 freq mindful (3) - 5 freq heidful (3) - 1 freq handel (3) - 1 freq haunful (3) - 1 freq handsel (3) - 7 freq handfae (3) - 2 freq haundfus (3) - 3 freq handfoo (3) - 1 freq haundel (4) - 1 freq haandfoo (4) - 1 freq needful (4) - 4 freq handle (4) - 36 freq haundsel (4) - 3 freq handrail (4) - 1 freq handily (4) - 1 freq handsum (4) - 1 freq hateful (4) - 4 freq harmful (4) - 1 freq thankful (4) - 11 freq hanfu (4) - 10 freq helpful (5) - 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 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 - HNTFL handful - 3 freq haundful - 1 freq |
HANDFUL |
| Time to execute Levenshtein function - 0.222812 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.375661 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.029705 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.037093 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.000840 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. |