SEQUENCE MATCHING

摘要

A method of determining the degree of match between a plurality of strings of signifiers. The method comprises the steps of: (i) identifying a possible signifier match between two signifiers in different strings; (ii) determining an upper bound to the probability of any of the possible solutions containing the possible signifier match; (iii) comparing the upper probability bound for the possible solutions with a threshold probability; and (iv) eliminating from the set of possible match solutions those solutions including the possible signifier match if the upper probability bound for the possible solutions is less than the threshold probability.