In the CCM framework, these rules can be represented as hard constraints in the search space for Y .
where J (rule) ⊆ MM is the set of pairs that can be determined by linguistic rules, and rule(j) ∈ R T is the corresponding decision for pair j according to these rules.