| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halpfu (0) - 1 freq helpfu (1) - 21 freq hatefu (2) - 5 freq balefu (2) - 2 freq halpit (2) - 12 freq helpful (2) - 6 freq halpin (2) - 5 freq halp (2) - 54 freq halped (2) - 2 freq halper (2) - 2 freq halpt (2) - 1 freq halfa (2) - 2 freq howpfu (2) - 20 freq halps (2) - 1 freq hanfu (2) - 10 freq handfu (2) - 10 freq half (2) - 539 freq helpfu' (2) - 2 freq haunfu (2) - 8 freq haunful (3) - 1 freq halted (3) - 2 freq hallow (3) - 2 freq ralph (3) - 5 freq halls (3) - 13 freq halved (3) - 2 freq |
halpfu (0) - 1 freq helpfu (1) - 21 freq halfa (3) - 2 freq halpt (3) - 1 freq halps (3) - 1 freq helpfu' (3) - 2 freq helpfae (3) - 1 freq halper (3) - 2 freq half (3) - 539 freq howpfu (3) - 20 freq helpful (3) - 6 freq halped (3) - 2 freq halpin (3) - 5 freq halpit (3) - 12 freq halp (3) - 54 freq helf (4) - 2 freq helps (4) - 56 freq hlf (4) - 2 freq hopefu (4) - 11 freq humpf (4) - 1 freq help (4) - 1140 freq helpit (4) - 52 freq helpt (4) - 9 freq helper (4) - 5 freq haulf (4) - 4 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 |
HALPFU |
| Time to execute Levenshtein function - 0.209457 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.369135 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.028063 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.037606 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.000904 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. |