  We bound the change in entropy incurred by an irreducible subshift of finite
type upon perturbing it by forbidding a pair of admissible words. Lind has
proven such bounds in the one-word case, and we adapt his methods. In
particular, we introduce multi-word correlation polynomials and study their
size, as well as that of their determinant in the two-word case.
