| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanlessly (0) - 1 freq wanless (2) - 3 freq seamlessly (3) - 1 freq wordlessly (3) - 1 freq wanresty (3) - 2 freq fearlessly (3) - 2 freq winless (3) - 1 freq carelessly (3) - 7 freq tentlessly (3) - 6 freq endlessly (3) - 3 freq sakelessly (3) - 1 freq wirdlessly (3) - 1 freq mindlessly (3) - 3 freq soonlessly (3) - 1 freq halely (4) - 7 freq kinless (4) - 1 freq wanlucky (4) - 1 freq waves'll (4) - 1 freq wally (4) - 48 freq anes'l (4) - 1 freq tapless (4) - 2 freq wankers (4) - 5 freq wanlas (4) - 1 freq pointlessly (4) - 1 freq wales (4) - 39 freq |
wanlessly (0) - 1 freq wanless (3) - 3 freq soonlessly (4) - 1 freq winless (4) - 1 freq endlessly (5) - 3 freq mindlessly (5) - 3 freq tentlessly (5) - 6 freq sakelessly (5) - 1 freq wirdlessly (5) - 1 freq carelessly (5) - 7 freq wordlessly (5) - 1 freq seamlessly (5) - 1 freq fearlessly (5) - 2 freq wutless (6) - 1 freq clossly (6) - 2 freq enless (6) - 12 freq witless (6) - 6 freq oonless (6) - 4 freq wholesale (6) - 2 freq senselessly (6) - 1 freq haanless (6) - 1 freq wanlos (6) - 1 freq hopelessly (6) - 1 freq sunless (6) - 1 freq howplessly (6) - 2 freq |
SoundEx code - W542 wanlos - 1 freq wameless - 1 freq wanless - 3 freq wanlessly - 1 freq wanluck - 1 freq whummles - 1 freq wean-like - 1 freq winless - 1 freq wanlockheid - 1 freq wanlas - 1 freq wanluk - 1 freq wanlucky - 1 freq winnelstrae - 1 freq |
MetaPhone code - WNLSL wanlessly - 1 freq |
WANLESSLY |
| Time to execute Levenshtein function - 0.242078 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.380481 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.028303 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.037634 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.000900 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. |