| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weerless (0) - 2 freq peerless (1) - 1 freq deedless (2) - 1 freq weelness (2) - 1 freq fearless (2) - 9 freq weesles (2) - 1 freq weetness (2) - 1 freq wee-ness (2) - 1 freq deerness (2) - 3 freq heedless (2) - 6 freq weelass (2) - 2 freq needless (2) - 16 freq yearless (2) - 1 freq kerless (2) - 1 freq reekless (2) - 1 freq teenless (2) - 1 freq wee-est (3) - 23 freq wheres (3) - 9 freq weetest (3) - 1 freq week-ens (3) - 1 freq weeshes (3) - 1 freq weekens (3) - 1 freq repress (3) - 1 freq feefles (3) - 1 freq regerdless (3) - 1 freq |
weerless (0) - 2 freq peerless (2) - 1 freq weelass (3) - 2 freq yearless (3) - 1 freq kerless (3) - 1 freq wyreless (3) - 4 freq wireless (3) - 55 freq fearless (3) - 9 freq marless (4) - 8 freq wutless (4) - 1 freq weariness (4) - 1 freq wordless (4) - 3 freq pouerless (4) - 2 freq airless (4) - 1 freq wanless (4) - 3 freq winless (4) - 1 freq rueless (4) - 1 freq wameless (4) - 1 freq treeless (4) - 3 freq wirdless (4) - 1 freq doorless (4) - 1 freq sairless (4) - 1 freq powerless (4) - 2 freq wee-ness (4) - 1 freq deerness (4) - 3 freq |
SoundEx code - W642 warlock - 43 freq weerless - 2 freq whirligig - 2 freq whirlies - 2 freq warlocks - 5 freq warl's - 6 freq whirliegig - 1 freq wireless - 55 freq warls - 4 freq worls - 5 freq wirelesses - 1 freq worl's - 1 freq warliewise - 1 freq warlie-wise - 1 freq warlockry - 3 freq warlock's - 8 freq wheer-laek - 1 freq wyreless - 4 freq whurls - 1 freq whirls - 3 freq whorls - 1 freq warlock-kirtle - 1 freq weirlik - 1 freq 'wireless' - 1 freq wirelessheid - 1 freq weiralison - 3 freq |
MetaPhone code - WRLS weerless - 2 freq whirlies - 2 freq warl's - 6 freq wireless - 55 freq warls - 4 freq worls - 5 freq worl's - 1 freq whurls - 1 freq whirls - 3 freq whorls - 1 freq 'wireless' - 1 freq |
WEERLESS |
| Time to execute Levenshtein function - 0.253569 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.432063 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.041412 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.041681 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.000812 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. |