| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| writhed (0) - 1 freq writhe (1) - 1 freq whited (2) - 2 freq frothed (2) - 4 freq writer (2) - 65 freq write' (2) - 2 freq rither (2) - 6 freq laithed (2) - 2 freq weiched (2) - 1 freq write (2) - 380 freq withen (2) - 5 freq swithed (2) - 1 freq graithed (2) - 12 freq brither (2) - 344 freq wither (2) - 142 freq written (2) - 276 freq wreitched (2) - 1 freq writhan (2) - 1 freq writeen (2) - 3 freq wretched (2) - 9 freq weighed (2) - 14 freq writes (2) - 44 freq waithe (2) - 1 freq wrather (2) - 1 freq writen (2) - 1 freq |
writhed (0) - 1 freq writhe (2) - 1 freq wreathed (2) - 5 freq wreitched (3) - 1 freq graithed (3) - 12 freq writhan (3) - 1 freq writhin (3) - 10 freq wretched (3) - 9 freq frothed (3) - 4 freq wrather (3) - 1 freq writen (4) - 1 freq whither (4) - 132 freq wished (4) - 61 freq birthed (4) - 3 freq breathed (4) - 20 freq berthed (4) - 1 freq wraiths (4) - 5 freq wrath (4) - 19 freq wraith (4) - 17 freq waithe (4) - 1 freq wurthet (4) - 1 freq waited (4) - 107 freq gritted (4) - 3 freq write' (4) - 2 freq rither (4) - 6 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 |
WRITHED |
| Time to execute Levenshtein function - 0.205986 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.385309 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.028340 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.036371 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.000835 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. |