| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halpit (0) - 12 freq halpin (1) - 5 freq halpt (1) - 1 freq haltit (1) - 3 freq happit (1) - 104 freq helpit (1) - 52 freq haipit (1) - 1 freq whalpit (1) - 4 freq dawpit (2) - 1 freq halpfu (2) - 1 freq dampit (2) - 1 freq halped (2) - 2 freq lappit (2) - 7 freq calmit (2) - 2 freq cappit (2) - 3 freq haikit (2) - 1 freq hapt (2) - 5 freq shaepit (2) - 2 freq halp (2) - 54 freq gulpit (2) - 3 freq helpin (2) - 87 freq campit (2) - 2 freq rappit (2) - 1 freq hainit (2) - 6 freq yaupit (2) - 1 freq |
halpit (0) - 12 freq helpit (1) - 52 freq halpt (1) - 1 freq halpin (2) - 5 freq helpt (2) - 9 freq whalpit (2) - 4 freq haipit (2) - 1 freq haltit (2) - 3 freq happit (2) - 104 freq haulit (3) - 3 freq howpit (3) - 19 freq shilpit (3) - 70 freq chilpit (3) - 2 freq halt (3) - 28 freq halplie (3) - 1 freq halikit (3) - 1 freq heapit (3) - 4 freq hopit (3) - 6 freq haultit (3) - 1 freq kelpit (3) - 4 freq haltet (3) - 1 freq halps (3) - 1 freq hippit (3) - 7 freq hoppit (3) - 2 freq halper (3) - 2 freq |
SoundEx code - H413 helpit - 52 freq hole-bit - 1 freq helped - 92 freq halibut - 5 freq halved - 2 freq halfdemon-half-cherub - 1 freq halfdan - 5 freq halfdan's - 1 freq hallibit - 1 freq helpt - 9 freq half-eaten - 2 freq half-hidden - 1 freq helvetiscots - 1 freq halpt - 1 freq half-hoidit - 1 freq half-tirn - 1 freq half-deid - 1 freq halpit - 12 freq half-digested - 1 freq halped - 2 freq half-dön - 1 freq half-done - 1 freq half-böts - 1 freq half-thacket - 1 freq half-bottle - 1 freq half-day's - 1 freq half-hid - 1 freq half-wit - 1 freq €˜holo-videos - 1 freq half-dozen - 1 freq |
MetaPhone code - HLPT helpit - 52 freq helped - 92 freq helpt - 9 freq halpt - 1 freq halpit - 12 freq halped - 2 freq |
HALPIT |
| Time to execute Levenshtein function - 0.326082 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.631176 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.065431 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.042270 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.000946 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. |