Elimination Method 1
Since our dictionary contains only good words and does not contain bad words, we can see that, if a good dictionary exists, that dictionary cannot contain bad words. In other words, if a dictionary contains good words only, that dictionary cannot contain bad words. For example,
Since \(D(w)\) contains good words only, then
We can also put it in this form
We can also put this in this form
In other words, if \(D(w)\) exists it can only contain positive words. Or if a dictionary contains at least a good word—if a good word exists in a dictionary—then that dictionary cannot contain bad words. In other words, a dictionary cannot contain both good words and bad words. A dictionary can only contain good words.
By applying the technique above, that reduces the size of our dictionary as shown to the right of the table.
To better understand the technique above as well as the table, we can take it like this. In \(D(\bar w)\), the fact that \( w_1\) or other positive words exist, then \( \bar w_2\) cannot exist. In this case, \( \bar w_2\) must equal to 0. From that, we can see from our dictionary:
If at least one good word exists in our dictionary, then there should not be any bad words in our dictionary.
Here, we use 0 to denote words that do not exist in our dictionary. For example, \( \bar w_2=0\) means that \( \bar w_2\) does not exist in our dictionary. The table below shows an example of the elimination process.
| Original | Process of Elimination |
|---|---|
| \( w_1\) | \( w_1\) is valid, so we keep \( w_1\) in our dictionary |
| \(\bar w_2\) | \(\bar w_2\) is not valid, therefore \(\bar w_2=0\), so it is eliminated from our dictionary |
| \( w_3\) | Existence of \( w_3\) is valid, so we keep it in our dictionary |
| \( w_4\) | Existence of \( w_4\) is valid, so we keep it in our dictionary |
| \(\bar w_5\) | \(\bar w_5\) is not valid, therefore \(\bar w_5=0\), so it is eliminated from our dictionary |
After the elimination process, we let \(w_1 = \hat w_1\), \(w_3 = \hat w_3\), and \(w_4 = \hat w_4\), so we have
What is important here is that existence of positive words in our parent’s dictionary does not allow the existence of negative words in that dictionary. By understanding the feedback process, we can see that when we repeat bad words, our parent provides us feedback to enable the correction. This process tells us that our parent’s dictionary contains good words only and does not contain any negative words. Since we want our dictionary to be equal to our parent’s dictionary by containing good words only, the process of elimination enables us to analyze words and determine that they are bad and eliminate them in our dictionary so we can match our parent’s dictionary. From above, we can simply re-index them.
Now that we understand our dictionary must contain only good words in order to be equal to our parent’s dictionary, we can continue with the overall process of reducing the size of our dictionary. From now on, all the other elimination methods will be based on the first elimination method.
Explore More in Natural Dictionary
Practice word elimination and explore the full dictionary in our interactive app.
Open Natural Dictionary App