I guess calculating the Levenshtein distance between the sets would work somehow?

Edit: scratch that, just intersect the set of available pieces with each set. If there are fewer than n--or m%--missing pieces, suggest those.