| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| halped (0) - 2 freq halved (1) - 2 freq halled (1) - 2 freq halper (1) - 2 freq halted (1) - 2 freq happed (1) - 35 freq haled (1) - 1 freq helped (1) - 92 freq haiped (1) - 1 freq hatted (2) - 1 freq hyped (2) - 2 freq warped (2) - 5 freq hared (2) - 1 freq healed (2) - 10 freq hailsed (2) - 2 freq walked (2) - 285 freq haired (2) - 7 freq harned (2) - 3 freq hauded (2) - 2 freq raiped (2) - 5 freq ealled (2) - 1 freq gawped (2) - 32 freq lapped (2) - 4 freq gaeped (2) - 1 freq falded (2) - 1 freq |
halped (0) - 2 freq helped (1) - 92 freq halled (2) - 2 freq halved (2) - 2 freq haled (2) - 1 freq haiped (2) - 1 freq happed (2) - 35 freq halper (2) - 2 freq halted (2) - 2 freq halpit (3) - 12 freq helpen (3) - 1 freq hallaed (3) - 1 freq hooped (3) - 1 freq haaled (3) - 21 freq halpin (3) - 5 freq hepped (3) - 1 freq halp (3) - 54 freq humped (3) - 2 freq halpfu (3) - 1 freq hoped (3) - 42 freq heaped (3) - 3 freq halpt (3) - 1 freq yelped (3) - 4 freq gulped (3) - 7 freq howped (3) - 14 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 |
HALPED |
| Time to execute Levenshtein function - 0.196742 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.392096 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.031251 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.037882 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.000911 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. |