Hierarchies of Words
Two words form a hierarchy if their associated relevant bits form
a hierarchy (i.e., if one set of bits includes the other). Words in hierarchies
can be either normal or inverse words. The following example is the simplest
case of a hierarchy of two normal words. In this example, as should be evident
from the bits, Word5 is hierarchically above Word4. Therefore, when the two
words are combined, the result is the higher of the two words, Word5. Two
words in the same hierarchy can never appear together in a label.
Word5
| –––11–––
|
Word4
| –––1––––
|
Word5
| –––11–––
|
|