The support set of a pattern is the set of pairs of entities that appear in the place of the entity placeholders in all strings in the corpus that match the pattern.
if a support set S has only few elements due to sparsity, it may become a subset of another support set B, even if the two patterns are semantically different.