The classical Friedgut–Kalai–Naor theorem describes the structure of linear functions on the Boolean cube which are almost Boolean. We describe extensions of this theorem to functions on the biased Boolean cube and on the slice, simplifying our earlier work.