| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helpfu (0) - 21 freq helpfu' (1) - 2 freq helpful (1) - 6 freq halpfu (1) - 1 freq unhelpfu (2) - 1 freq helpfae (2) - 1 freq helpin (2) - 87 freq hertfu (2) - 1 freq help's (2) - 3 freq helpt (2) - 9 freq helpan (2) - 1 freq heedfu (2) - 1 freq helf (2) - 2 freq howpfu (2) - 20 freq helper (2) - 5 freq helpit (2) - 52 freq hermfu (2) - 3 freq helpen (2) - 1 freq helped (2) - 91 freq help (2) - 1128 freq helps (2) - 55 freq leefu (3) - 1 freq heaps (3) - 13 freq heapit (3) - 4 freq fethfu (3) - 1 freq |
helpfu (0) - 21 freq halpfu (1) - 1 freq helpfae (2) - 1 freq helpful (2) - 6 freq helpfu' (2) - 2 freq helper (3) - 5 freq howpfu (3) - 20 freq helpit (3) - 52 freq helped (3) - 91 freq helf (3) - 2 freq help (3) - 1128 freq helpen (3) - 1 freq helps (3) - 55 freq helpin (3) - 87 freq helpt (3) - 9 freq unhelpfu (3) - 1 freq helpan (3) - 1 freq halped (4) - 2 freq halp (4) - 54 freq half (4) - 539 freq hopefu (4) - 11 freq halfa (4) - 2 freq humpf (4) - 1 freq heedfu (4) - 1 freq halps (4) - 1 freq |
SoundEx code - H410 help - 1128 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 - 6 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.198650 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.358615 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.027228 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.036791 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.000865 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. |