| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| help (0) - 1140 freq hel (1) - 15 freq heli (1) - 3 freq hel' (1) - 11 freq 'help (1) - 19 freq halp (1) - 54 freq kelp (1) - 13 freq hemp (1) - 3 freq helt (1) - 5 freq heap (1) - 46 freq hesp (1) - 1 freq held (1) - 509 freq heup (1) - 1 freq helf (1) - 2 freq welp (1) - 1 freq helm (1) - 15 freq helps (1) - 56 freq whelp (1) - 1 freq yelp (1) - 20 freq helpt (1) - 9 freq hell (1) - 375 freq hela (1) - 1 freq hylop (2) - 1 freq haip (2) - 7 freq heer (2) - 19 freq |
help (0) - 1140 freq halp (1) - 54 freq helps (2) - 56 freq helm (2) - 15 freq welp (2) - 1 freq helf (2) - 2 freq whelp (2) - 1 freq helpt (2) - 9 freq hela (2) - 1 freq hell (2) - 375 freq heup (2) - 1 freq hylop (2) - 1 freq yelp (2) - 20 freq 'help (2) - 19 freq heli (2) - 3 freq hel (2) - 15 freq held (2) - 509 freq kelp (2) - 13 freq hel' (2) - 11 freq hesp (2) - 1 freq heap (2) - 46 freq helt (2) - 5 freq hemp (2) - 3 freq huls (3) - 6 freq hoop (3) - 34 freq |
SoundEx code - H410 help - 1140 freq half - 539 freq half-wey - 1 freq 'help - 19 freq helluva - 25 freq 'half - 2 freq helpfu - 21 freq halleve - 2 freq helf - 2 freq haulf - 4 freq halfway - 7 freq holby - 4 freq halp - 54 freq halfwye - 1 freq half-wye - 1 freq 'helpfae' - 1 freq helpfae - 1 freq halfa - 2 freq 'help' - 1 freq halpfu - 1 freq hlf - 2 freq helpfu' - 2 freq 'half-awa' - 1 freq 'half-awa - 1 freq half-awa - 2 freq €˜help - 2 freq €˜halp - 1 freq hallabie - 1 freq €œhelp - 3 freq hylop - 1 freq h-alba - 2 freq €˜half - 1 freq halve - 1 freq hellova - 2 freq haleve - 1 freq halabi - 1 freq hlv - 1 freq hollieb - 4 freq |
MetaPhone code - HLP help - 1140 freq 'help - 19 freq halp - 54 freq 'help' - 1 freq €˜help - 2 freq €˜halp - 1 freq €œhelp - 3 freq |
HELP help - 1140 freq helper - 5 freq helps - 56 freq helped - 92 freq helping - 23 freq helpin - 87 freq |
| Time to execute Levenshtein function - 0.202801 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.387246 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.029574 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.040028 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.001209 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. |