| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haveless (0) - 1 freq haiveless (1) - 1 freq thaveless (1) - 3 freq hameless (1) - 17 freq hopeless (2) - 12 freq daeless (2) - 4 freq faceless (2) - 5 freq handless (2) - 3 freq haanless (2) - 1 freq nameless (2) - 5 freq ageless (2) - 5 freq halpless (2) - 1 freq harnless (2) - 3 freq haimless (2) - 1 freq harmless (2) - 6 freq loveless (2) - 1 freq homeless (2) - 3 freq haagless (2) - 1 freq luveless (2) - 1 freq shameless (2) - 3 freq sakeless (2) - 5 freq hapless (2) - 11 freq hairless (2) - 2 freq careless (2) - 10 freq wameless (2) - 1 freq |
haveless (0) - 1 freq haiveless (1) - 1 freq hameless (2) - 17 freq thaveless (2) - 3 freq haimless (3) - 1 freq haunless (3) - 3 freq loveless (3) - 1 freq haagless (3) - 1 freq hapless (3) - 11 freq homeless (3) - 3 freq haanless (3) - 1 freq hopeless (3) - 12 freq luveless (3) - 1 freq hairless (3) - 2 freq thraveless (4) - 5 freq heedless (4) - 6 freq hopless (4) - 1 freq muiveless (4) - 1 freq hovels (4) - 1 freq hovel's (4) - 1 freq heidless (4) - 12 freq heatless (4) - 1 freq heaviness (4) - 2 freq thieveless (4) - 1 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 - HFLS haiveless - 1 freq hovels - 1 freq hovel's - 1 freq highheels - 1 freq haveless - 1 freq |
HAVELESS |
| Time to execute Levenshtein function - 0.221362 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.380695 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.036180 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.037255 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.000823 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. |