| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halpit (0) - 12 freq haltit (1) - 3 freq helpit (1) - 52 freq halpin (1) - 5 freq haipit (1) - 1 freq whalpit (1) - 4 freq halpt (1) - 1 freq happit (1) - 102 freq rappit (2) - 1 freq haudit (2) - 42 freq yaupit (2) - 1 freq harit (2) - 1 freq haggit (2) - 3 freq champit (2) - 11 freq haikit (2) - 1 freq handit (2) - 27 freq halplie (2) - 1 freq haultit (2) - 1 freq salvit (2) - 1 freq yappit (2) - 1 freq harrit (2) - 1 freq hautit (2) - 2 freq jaupit (2) - 1 freq cappit (2) - 3 freq lappit (2) - 7 freq |
halpit (0) - 12 freq halpt (1) - 1 freq helpit (1) - 52 freq whalpit (2) - 4 freq happit (2) - 102 freq helpt (2) - 9 freq haltit (2) - 3 freq haipit (2) - 1 freq halpin (2) - 5 freq pulpit (3) - 9 freq shilpit (3) - 68 freq chilpit (3) - 2 freq halps (3) - 1 freq hoppit (3) - 2 freq holit (3) - 1 freq halpfu (3) - 1 freq hapt (3) - 5 freq heapit (3) - 4 freq halp (3) - 54 freq halt (3) - 26 freq halikit (3) - 1 freq hippit (3) - 7 freq gulpit (3) - 3 freq hopit (3) - 2 freq hiltit (3) - 1 freq |
SoundEx code - H413 helpit - 52 freq hole-bit - 1 freq helped - 91 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-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-eaten - 1 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 - 91 freq helpt - 9 freq halpt - 1 freq halpit - 12 freq halped - 2 freq |
HALPIT |
| Time to execute Levenshtein function - 0.188607 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.329367 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.026772 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.036462 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.000790 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. |