| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wreathed (0) - 5 freq breathed (1) - 20 freq wreitched (2) - 1 freq writhed (2) - 1 freq sheathed (2) - 1 freq wreaked (2) - 1 freq wreaths (2) - 6 freq preached (2) - 3 freq breather (2) - 5 freq wretched (2) - 9 freq wrenched (2) - 1 freq created (2) - 26 freq breathes (2) - 9 freq wreath (2) - 14 freq wrather (2) - 1 freq breached (2) - 5 freq weather (2) - 178 freq wrestled (2) - 2 freq reached (2) - 135 freq treated (2) - 42 freq breathe' (2) - 3 freq breathe (2) - 60 freq greeted (3) - 27 freq treetled (3) - 5 freq rented (3) - 4 freq |
wreathed (0) - 5 freq writhed (2) - 1 freq breathed (2) - 20 freq wretched (3) - 9 freq wreaths (3) - 6 freq wreath (3) - 14 freq wreitched (3) - 1 freq wrather (3) - 1 freq breathe' (4) - 3 freq treated (4) - 42 freq unearthed (4) - 7 freq breathe (4) - 60 freq berthed (4) - 1 freq frothed (4) - 4 freq graithed (4) - 12 freq writhe (4) - 1 freq reached (4) - 135 freq wrath (4) - 19 freq wrestled (4) - 2 freq wreaked (4) - 1 freq preached (4) - 3 freq created (4) - 26 freq wrenched (4) - 1 freq breather (4) - 5 freq breathes (4) - 9 freq |
SoundEx code - W633 weirdit - 5 freq wurthet - 1 freq wreathed - 5 freq wirdit - 1 freq writhed - 1 freq wurriet'at - 1 freq wair-tid - 2 freq wearetidelines - 2 freq wordhttps - 1 freq worded - 1 freq word--what - 1 freq |
MetaPhone code - R0T wreathed - 5 freq writhed - 1 freq |
WREATHED |
| Time to execute Levenshtein function - 0.207105 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.364074 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.027567 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.036796 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.000933 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. |