Abstract: In this talk I will describe the "Laguerre series" of a set of factorizations of words, which is a formal sum of weighted Laguerre polynomials with parameter α = -1. The product of Laguerre series has a useful combinatorial interpretation, and Laguerre series can be computed by finding an appropriate ordinary generating function and applying a certain transformation which is related to the Laplace transform. This gives a technique which allows us to count words subject to various restrictions. For example, the number of arrangements of the word "WALLAWALLA" with no LLL, AAA or WW as consecutive subwords is ∫₀^∞ e^-t (t⁴/24 - t² + t)² (t²/2 - t) dt = 1584.