the study of a tree introduced by lascoux-schutzenberger yields a family of tableaux correspondences which can be used to enumerate the number of reduced factorizations of a permutation. representing reduced words by certain line diagrams, these corresponences can be obtained by an algorithm of d. little in a remarkably simple manner. the talk uses a beautiful applet also created by d. little which illustrates the algorithm and should be helful in any further studies of reduced words.