| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wardly (0) - 1 freq eardly (1) - 1 freq warldly (1) - 4 freq waridly (1) - 1 freq wardle (1) - 11 freq warily (1) - 3 freq hardly (1) - 215 freq warmly (1) - 4 freq waurily (2) - 1 freq inwardly (2) - 1 freq yirdly (2) - 1 freq wrily (2) - 1 freq warle (2) - 1 freq badly (2) - 30 freq weirdly (2) - 5 freq haardly (2) - 1 freq wordy (2) - 11 freq warden (2) - 6 freq waldy (2) - 1 freq wardlaw (2) - 2 freq wary (2) - 11 freq ward (2) - 89 freq madly (2) - 5 freq warls (2) - 4 freq varday (2) - 2 freq |
wardly (0) - 1 freq wardle (1) - 11 freq waridly (1) - 1 freq eardly (2) - 1 freq weirdly (2) - 5 freq warmly (2) - 4 freq hardly (2) - 215 freq warldly (2) - 4 freq warily (2) - 3 freq hairdly (3) - 55 freq lairdly (3) - 2 freq herdly (3) - 18 freq wirdy (3) - 1 freq wearily (3) - 1 freq waddle (3) - 1 freq warl (3) - 164 freq haurdly (3) - 62 freq cowardly (3) - 4 freq wildly (3) - 7 freq upwardly (3) - 1 freq wards (3) - 30 freq warple (3) - 1 freq erdly (3) - 1 freq warsle (3) - 24 freq mardle (3) - 1 freq |
SoundEx code - W634 wirthless - 2 freq wortheliche - 1 freq worrit-like - 4 freq weird-like - 2 freq wardly - 1 freq worthwhile - 5 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 - WRTL wardly - 1 freq wardlaw - 2 freq weirdly - 5 freq waridly - 1 freq wardle - 11 freq worriedly - 1 freq |
WARDLY |
| Time to execute Levenshtein function - 0.371288 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 - 1.092047 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.100422 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.179123 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.001470 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. |