| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helpfu (0) - 21 freq helpfu' (1) - 2 freq halpfu (1) - 1 freq helpful (1) - 6 freq helpit (2) - 52 freq helf (2) - 2 freq helpan (2) - 1 freq hermfu (2) - 3 freq helpt (2) - 9 freq howpfu (2) - 20 freq helpen (2) - 1 freq helper (2) - 5 freq help (2) - 1140 freq unhelpfu (2) - 1 freq helps (2) - 56 freq helped (2) - 92 freq help's (2) - 3 freq helpfae (2) - 1 freq helpin (2) - 87 freq heedfu (2) - 1 freq hertfu (2) - 1 freq halp (3) - 54 freq elph (3) - 1 freq heller (3) - 3 freq helmet (3) - 15 freq |
helpfu (0) - 21 freq halpfu (1) - 1 freq helpfae (2) - 1 freq helpfu' (2) - 2 freq helpful (2) - 6 freq helps (3) - 56 freq unhelpfu (3) - 1 freq helpin (3) - 87 freq helper (3) - 5 freq helped (3) - 92 freq help (3) - 1140 freq helpen (3) - 1 freq helpit (3) - 52 freq helpan (3) - 1 freq helf (3) - 2 freq howpfu (3) - 20 freq helpt (3) - 9 freq halped (4) - 2 freq halpt (4) - 1 freq half (4) - 539 freq hopefu (4) - 11 freq halps (4) - 1 freq halfa (4) - 2 freq halpit (4) - 12 freq halper (4) - 2 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 - HLPF helpfu - 21 freq 'helpfae' - 1 freq helpfae - 1 freq halpfu - 1 freq helpfu' - 2 freq |
HELPFU |
| Time to execute Levenshtein function - 0.231912 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.325682 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.027708 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.036918 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.001045 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. |