 Different approximate matchers impose different constraints.Some matchers use a single global unweighted cost, that is, the total number of primitive operations necessary to convert the match to the pattern.For example, if the pattern is "coil", "foil" differs by one substitution, "coils" by one insertion, "oil" by one deletion, and "foal" by two substitutions.