
in the third position, minus a penalty for the mismatch between the “A”
in the problem solution and the “B” in the rule, minus another penalty
for the final “B” in the solution, which corresponds with a “.” or no con-
nection in the rule.
The next rule says that a state of “A” for the second node corresponds
with anything in the fifth node. Since the proposed solution does meet
the criterion, the sum is added for a match in this row. Thus the program
goes through, comparing the symbol string to the rules. A measure of
goodness is defined by the sum of the weights of all constraints that are
satisfied by a pattern of values:
GW
m
nr
=
∑∑
where r is rules, n is ...