| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helpless (0) - 17 freq halpless (1) - 1 freq selfless (2) - 3 freq howpless (2) - 5 freq helplessly (2) - 7 freq hermless (2) - 6 freq helpers (2) - 12 freq headless (2) - 1 freq halples (2) - 1 freq hopless (2) - 1 freq hoppless (2) - 1 freq heedless (2) - 6 freq heidless (2) - 12 freq heatless (2) - 1 freq hertless (2) - 11 freq hapless (2) - 11 freq eeseless (3) - 6 freq heles (3) - 1 freq ill-less (3) - 1 freq people's (3) - 12 freq fendless (3) - 1 freq hairless (3) - 2 freq crapless (3) - 1 freq heartless (3) - 6 freq nebless (3) - 1 freq |
helpless (0) - 17 freq halpless (1) - 1 freq hapless (3) - 11 freq halples (3) - 1 freq hoppless (3) - 1 freq helplessly (3) - 7 freq hopless (3) - 1 freq howpless (3) - 5 freq heatless (4) - 1 freq sleepless (4) - 7 freq hopeless (4) - 12 freq heidless (4) - 12 freq hertless (4) - 11 freq heedless (4) - 6 freq helpers (4) - 12 freq hermless (4) - 6 freq selfless (4) - 3 freq headless (4) - 1 freq tapless (5) - 2 freq harmless (5) - 6 freq helps (5) - 55 freq lampless (5) - 1 freq hirple's (5) - 1 freq bieldless (5) - 1 freq haagless (5) - 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 - HLPLS helpless - 17 freq halpless - 1 freq halples - 1 freq |
HELPLESS |
| Time to execute Levenshtein function - 0.193600 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.372404 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.027641 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.037774 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.000917 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. |