Semantic overlaps

Verilog HDL semantics of a case statement specifies a priority order in which a case branch is selected. The case expression is checked with the first case item, if it is not the same, the next case item is checked, if not the same, the next case item is checked, and so on. A priority order of case item checking is implied by the case statement. Additionally, in Verilog HDL, it is possible for two or more case item values to be the same or there may be overlapping case item values such as in casex and casez statements however, because of the priority order, only the first one in the listed sequence of case items is selected. 

Wikipedia concepts, has been shown to offer superior performance over the previous state-of-the-art algorithms. In contrast to the task of computing semantic relatedness, which usually deals with short texts whose overlap is often empty, information retrieval usually deals with longer documents. It is noteworthy that in such cases optimal results can be obtained by extending the bag of words with concepts rather than merely relying on the conceptual representation alone. 

The four possible approaches are Complex Syntax/ Complex Semantics Complex Syntax/ Simple Semantics Simple Syntax/ Simple Semantics and Simple Syntax/ Complex Semantics. The former two are termed hypersemantic because the deep structure is the combination of all of the component structures. The latter two are termed metasemantic because the deep structure is the overlap of the components. 

---