| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hameless (0) - 17 freq shameless (1) - 3 freq nameless (1) - 5 freq homeless (1) - 3 freq haveless (1) - 1 freq wameless (1) - 1 freq handless (2) - 3 freq hamlets (2) - 1 freq haleness (2) - 1 freq han-less (2) - 1 freq sameness (2) - 1 freq harmless (2) - 6 freq haagless (2) - 1 freq careless (2) - 10 freq rhymeless (2) - 1 freq daeless (2) - 4 freq harnless (2) - 3 freq faceless (2) - 5 freq lampless (2) - 1 freq thaveless (2) - 3 freq ageless (2) - 5 freq hameliness (2) - 1 freq halpless (2) - 1 freq shapeless (2) - 3 freq haunless (2) - 3 freq |
hameless (0) - 17 freq homeless (1) - 3 freq haimless (2) - 1 freq wameless (2) - 1 freq haveless (2) - 1 freq shameless (2) - 3 freq nameless (2) - 5 freq haanless (3) - 1 freq haunless (3) - 3 freq hairless (3) - 2 freq haiveless (3) - 1 freq hameliness (3) - 1 freq timeless (3) - 5 freq hapless (3) - 11 freq hamelins (3) - 1 freq hopeless (3) - 12 freq harmless (3) - 6 freq hamlets (3) - 1 freq haagless (3) - 1 freq rhymeless (3) - 1 freq goamless (4) - 1 freq seamless (4) - 5 freq harnless (4) - 3 freq hopless (4) - 1 freq hooseless (4) - 1 freq |
SoundEx code - H542 haunles - 3 freq hameless - 17 freq hannles - 5 freq hin-leg - 1 freq haunless - 3 freq hin-legs - 2 freq haimlock - 7 freq heimlich - 1 freq hunnels - 2 freq homelessness - 1 freq han'les - 1 freq hunnles - 1 freq hummles - 1 freq hummels - 1 freq homologatin - 1 freq homologatit - 6 freq homologate - 2 freq haanless - 1 freq hummlys - 1 freq hin-laigs - 1 freq haunnles - 2 freq haimless - 1 freq hanles - 1 freq haunels - 1 freq hinlegs - 1 freq haunnils - 1 freq han-less - 1 freq homeless - 3 freq hamelessness - 2 freq himmlesfaird - 1 freq hamwlqke - 2 freq homelesshorse - 8 freq hmolj - 1 freq hannahhiles - 1 freq |
MetaPhone code - HMLS hameless - 17 freq hummles - 1 freq hummels - 1 freq hummlys - 1 freq haimless - 1 freq homeless - 3 freq |
HAMELESS |
| Time to execute Levenshtein function - 0.416629 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.802990 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.085478 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.108938 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.001195 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. |