| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helplessly (0) - 7 freq selflessly (2) - 1 freq helpless (2) - 17 freq howplessly (2) - 2 freq fearlessly (3) - 2 freq halpless (3) - 1 freq hopelessly (3) - 1 freq tentlessly (3) - 6 freq seamlessly (3) - 1 freq endlessly (3) - 3 freq hopless (4) - 1 freq hapless (4) - 11 freq hellery (4) - 3 freq soonlessly (4) - 1 freq helpers (4) - 12 freq wanlessly (4) - 1 freq hoppless (4) - 1 freq hermless (4) - 6 freq mindlessly (4) - 3 freq selfless (4) - 3 freq relentlessly (4) - 6 freq carelessly (4) - 7 freq halples (4) - 1 freq helley (4) - 1 freq ruthlessly (4) - 1 freq |
helplessly (0) - 7 freq helpless (3) - 17 freq howplessly (3) - 2 freq hopelessly (4) - 1 freq halpless (4) - 1 freq selflessly (4) - 1 freq hoppless (6) - 1 freq halples (6) - 1 freq hapless (6) - 11 freq howpless (6) - 5 freq endlessly (6) - 3 freq tentlessly (6) - 6 freq seamlessly (6) - 1 freq fearlessly (6) - 2 freq hopless (6) - 1 freq sakelessly (7) - 1 freq heatless (7) - 1 freq senselessly (7) - 1 freq wirdlessly (7) - 1 freq heedless (7) - 6 freq help-yersel (7) - 1 freq sleepless (7) - 7 freq hertless (7) - 11 freq hopeless (7) - 12 freq tirelessly (7) - 1 freq |
SoundEx code - H414 helpless - 17 freq helplessly - 7 freq halflin - 14 freq halflins - 29 freq helpful - 6 freq half-blin - 1 freq halpless - 1 freq half-full - 1 freq helpline - 10 freq hillbillies - 3 freq hullabaloo - 1 freq half-believe - 1 freq half-lippenin - 1 freq half-believed - 1 freq half-laughed - 1 freq half-fill - 1 freq halfleens - 1 freq hullfulls - 1 freq halplie - 1 freq halples - 1 freq half-licht - 1 freq helpfully - 1 freq €œhillbillies - 2 freq helplessness - 2 freq half-listenin - 1 freq halplessness - 1 freq halfling - 1 freq |
MetaPhone code - HLPLSL helplessly - 7 freq |
HELPLESSLY |
| Time to execute Levenshtein function - 0.214524 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.400149 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.027529 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.039599 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.000885 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. |