| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wardle (0) - 11 freq warple (1) - 1 freq waddle (1) - 1 freq wardly (1) - 1 freq mardle (1) - 1 freq warsle (1) - 24 freq warle (1) - 1 freq wale (2) - 34 freq dwadle (2) - 1 freq wardar (2) - 1 freq girdle (2) - 15 freq warddec (2) - 1 freq warbles (2) - 3 freq ardler (2) - 1 freq warlie (2) - 2 freq warldlie (2) - 1 freq waddlet (2) - 2 freq waddles (2) - 1 freq wurdie (2) - 9 freq warkie (2) - 1 freq warstle (2) - 4 freq warie (2) - 1 freq garde (2) - 1 freq warmlie (2) - 3 freq paidle (2) - 1 freq |
wardle (0) - 11 freq wardly (1) - 1 freq warple (2) - 1 freq waridly (2) - 1 freq warle (2) - 1 freq warsle (2) - 24 freq waddle (2) - 1 freq mardle (2) - 1 freq heardle (3) - 5 freq warmly (3) - 4 freq wirdie (3) - 17 freq wardlaw (3) - 2 freq warl (3) - 164 freq wardin (3) - 1 freq hardly (3) - 215 freq hurdle (3) - 3 freq eardly (3) - 1 freq warder (3) - 3 freq warmlie (3) - 3 freq warldly (3) - 4 freq warll (3) - 1 freq eardley (3) - 1 freq wards (3) - 30 freq windle (3) - 1 freq warlie (3) - 2 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 |
WARDLE |
| Time to execute Levenshtein function - 0.190854 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.339308 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.027578 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.037256 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.000908 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. |