| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| worser (0) - 3 freq worker (1) - 23 freq worsen (1) - 1 freq worset (1) - 2 freq worse (1) - 206 freq wonder (2) - 135 freq dowser (2) - 1 freq cooser (2) - 3 freq torter (2) - 1 freq horses (2) - 113 freq dormer (2) - 2 freq loser (2) - 4 freq wooster (2) - 1 freq wirker (2) - 5 freq worsid (2) - 2 freq wursel (2) - 2 freq horter (2) - 1 freq horse' (2) - 1 freq coorser (2) - 4 freq former (2) - 38 freq norse (2) - 53 freq sorner (2) - 3 freq worded (2) - 1 freq mowser (2) - 12 freq towser (2) - 6 freq |
worser (0) - 3 freq worse (2) - 206 freq worset (2) - 2 freq worker (2) - 23 freq worsen (2) - 1 freq werker (3) - 2 freq warsel (3) - 3 freq warmer (3) - 25 freq wurker (3) - 3 freq warder (3) - 3 freq worsley (3) - 1 freq wasser (3) - 1 freq warse (3) - 29 freq wirset (3) - 1 freq warker (3) - 7 freq coorser (3) - 4 freq werner (3) - 1 freq wirse (3) - 6 freq wiser (3) - 26 freq worsit (3) - 11 freq wurse (3) - 16 freq owerseer (3) - 5 freq wirker (3) - 5 freq worsid (3) - 2 freq warner (3) - 1 freq |
SoundEx code - W626 wirkers - 19 freq workers - 34 freq worker - 23 freq wirker - 5 freq werker - 2 freq wurker - 3 freq wurkers - 6 freq warker - 7 freq warkers - 43 freq warkers' - 1 freq wurkhoarse - 1 freq wirk-rochened - 1 freq workers' - 3 freq 'warkers - 1 freq worser - 3 freq wirk-a-wark - 1 freq waarkers - 4 freq warkrooms - 1 freq wurkur - 3 freq wirkers' - 2 freq warkar - 1 freq warwickshire-born - 1 freq wark-oors - 1 freq wurkirs - 1 freq warricker - 1 freq |
MetaPhone code - WRSR worser - 3 freq |
WORSER |
| Time to execute Levenshtein function - 0.211701 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.342350 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.027727 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.043302 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.000855 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. |