we generalize a result of mazorchuk and tenner, showing that the “run” statistic influences the shape of the rsk tableaux of an arbitrary permutation. we define and construct the “canonical reduced word” of a boolean permutation, and show that the rsk tableaux for that permutation can be read off directly from this reduced word. we also describe those tableaux that can correspond to boolean permutations in terms of “uncrowded sets.” we then extend this work to fully commutative permutations, showing that each fully commutative permutation has a well-defined “boolean core,” related to the right weak order. the contents of the second row of the insertion tableaux of fully commutative permutations are partially ordered as subsets, with respect to the right weak order. we explore the partial order of these subsets, with particular interest in when they change from uncrowded to crowded. this is joint work with gunawan, russell and tenner, based on recent work in arxiv:2207.05119 and arxiv:2212.05002.