| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hopeless (0) - 12 freq hoppless (1) - 1 freq hopless (1) - 1 freq homeless (1) - 3 freq haveless (2) - 1 freq topless (2) - 1 freq howpless (2) - 5 freq shapeless (2) - 3 freq hopelessly (2) - 1 freq hapless (2) - 11 freq hooseless (2) - 1 freq shoeless (2) - 1 freq loveless (2) - 1 freq hameless (2) - 17 freq thoweless (2) - 2 freq hotel's (3) - 4 freq bounless (3) - 1 freq voiceless (3) - 19 freq careless (3) - 10 freq openers (3) - 2 freq harnless (3) - 3 freq halpless (3) - 1 freq oppress (3) - 1 freq eeseless (3) - 6 freq gormless (3) - 9 freq |
hopeless (0) - 12 freq hopless (1) - 1 freq homeless (2) - 3 freq hapless (2) - 11 freq hoppless (2) - 1 freq hooseless (3) - 1 freq haveless (3) - 1 freq hameless (3) - 17 freq hopelessly (3) - 1 freq topless (3) - 1 freq howpless (3) - 5 freq shapeless (3) - 3 freq hairless (4) - 2 freq halpless (4) - 1 freq haiveless (4) - 1 freq haagless (4) - 1 freq haunless (4) - 3 freq haanless (4) - 1 freq haimless (4) - 1 freq heatless (4) - 1 freq thoweless (4) - 2 freq loveless (4) - 1 freq shoeless (4) - 1 freq helpless (4) - 17 freq headless (4) - 1 freq |
SoundEx code - H142 howplessly - 2 freq hopeless - 12 freq hauf-licht - 6 freq hauflicht - 1 freq haiveless - 1 freq hobbles - 2 freq howplessness - 2 freq hovels - 1 freq hauf-likit - 1 freq hapless - 11 freq hopelessness - 2 freq hauf-lachin - 1 freq howpless - 5 freq hopless - 1 freq hubbleskyu - 2 freq hovel's - 1 freq hoppless - 1 freq haveless - 1 freq hafolk - 1 freq hubbelskyu - 1 freq hubbilshue - 1 freq hopelessly - 1 freq €˜hopelessly - 1 freq hauf-light - 2 freq hauf-lauchin - 1 freq hplayspiano - 1 freq |
MetaPhone code - HPLS hopeless - 12 freq hapless - 11 freq howpless - 5 freq hopless - 1 freq hoppless - 1 freq |
HOPELESS |
| Time to execute Levenshtein function - 0.482129 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.707307 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.040210 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.075044 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.001097 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. |