Indeed, with a little algebra it can be shown that solving a maximum weighted matching problem with weights c ij that count potential substitution costs gives the correct update for x.
c ij is the total cost of substitution edits in the active edit alignment prob-lems that would result if source character i were not mapped to target character j in the alphabet matching x.