  Edelman and Greene constructed a correspondence between reduced words of the
reverse permutation and standard Young tableaux. We prove that for any reduced
word the shape of the region of the insertion tableau containing the smallest
possible entries evolves exactly as the upper-left component of the
permutation's (Rothe) diagram. Properties of the Edelman-Greene bijection
restricted to 132-avoiding and 2143-avoiding permutations are presented. We
also consider the Edelman-Greene bijection applied to non-reduced words.
