Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wirdless (0) - 1 freq wireless (1) - 55 freq wordless (1) - 3 freq birdless (1) - 1 freq wirdlessly (2) - 1 freq wyndless (2) - 1 freq mindless (2) - 3 freq witless (2) - 6 freq fireless (2) - 3 freq wildness (2) - 6 freq airless (2) - 1 freq weirdness (2) - 1 freq wirdies (2) - 13 freq wyreless (2) - 4 freq winless (2) - 1 freq wirthless (2) - 2 freq tireless (2) - 1 freq girdles (2) - 1 freq birrless (2) - 4 freq wardle's (2) - 1 freq wirds (3) - 868 freq worthless (3) - 1 freq windae's (3) - 5 freq wirdie (3) - 17 freq bienless (3) - 2 freq |
wirdless (0) - 1 freq wordless (1) - 3 freq wireless (2) - 55 freq birdless (2) - 1 freq wyreless (3) - 4 freq wardle's (3) - 1 freq wyndless (3) - 1 freq wirdlessly (3) - 1 freq weirdness (3) - 1 freq girdles (4) - 1 freq birrless (4) - 4 freq weerless (4) - 2 freq wordiness (4) - 1 freq tireless (4) - 1 freq wordlessly (4) - 1 freq wirthless (4) - 2 freq mindless (4) - 3 freq wildness (4) - 6 freq fireless (4) - 3 freq airless (4) - 1 freq winless (4) - 1 freq wirdies (4) - 13 freq witless (4) - 6 freq hermless (5) - 6 freq marless (5) - 8 freq |
SoundEx code - W634 wirthless - 2 freq wortheliche - 1 freq worrit-like - 4 freq weird-like - 2 freq wardly - 1 freq worthwhile - 4 freq wardlaw - 2 freq worthliss - 1 freq wraith-waulker - 1 freq wordlessly - 1 freq weirdly - 5 freq wirdlessly - 1 freq waridly - 1 freq wardle - 11 freq worried-luikin - 1 freq worthwile - 1 freq weirdy-willie - 1 freq wirtwhile - 1 freq wurd-leet - 1 freq wradtle - 1 freq wordless - 3 freq worthless - 1 freq wirdless - 1 freq worriedly - 1 freq warthless - 2 freq wardle's - 1 freq warthwhile - 1 freq word-learnin - 1 freq weird-luikin - 1 freq wurthwhile - 1 freq worthelie - 1 freq |
MetaPhone code - WRTLS wordless - 3 freq wirdless - 1 freq wardle's - 1 freq |
WIRDLESS |
Time to execute Levenshtein function - 0.295810 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.542177 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.058516 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.037484 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.000773 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. |