| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helpit (0) - 52 freq halpit (1) - 12 freq helpt (1) - 9 freq kelpit (1) - 4 freq heapit (1) - 4 freq helpin (1) - 87 freq happit (2) - 102 freq meltit (2) - 26 freq heppin (2) - 1 freq henkit (2) - 1 freq haipit (2) - 1 freq haltit (2) - 3 freq halpin (2) - 5 freq teapit (2) - 1 freq helt (2) - 5 freq heezit (2) - 4 freq helper (2) - 5 freq headit (2) - 19 freq cheepit (2) - 3 freq gulpit (2) - 3 freq heilit (2) - 1 freq heapt (2) - 1 freq leapit (2) - 2 freq hertit (2) - 17 freq herdit (2) - 8 freq |
helpit (0) - 52 freq halpit (1) - 12 freq helpt (1) - 9 freq halpt (2) - 1 freq helpin (2) - 87 freq kelpit (2) - 4 freq heapit (2) - 4 freq holit (3) - 1 freq helped (3) - 91 freq hiltit (3) - 1 freq chilpit (3) - 2 freq humpit (3) - 1 freq leipit (3) - 1 freq shilpit (3) - 68 freq whalpit (3) - 4 freq hippit (3) - 7 freq helps (3) - 55 freq hempt (3) - 1 freq helmet (3) - 15 freq hoppit (3) - 2 freq helpen (3) - 1 freq pulpit (3) - 9 freq helpfu (3) - 21 freq howpit (3) - 19 freq help (3) - 1128 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 |
HELPIT |
| Time to execute Levenshtein function - 0.392210 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.548872 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.060882 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.076079 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.000773 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. |