  We provide generating functions, formulas, and asymptotic expressions for the
number of Catalan words based on the number of runs of ascents (descents), runs
of weak ascents (descents), $\ell$-valleys, valleys, symmetric valleys,
$\ell$-peaks, peaks, and symmetric peaks. We also establish some bijections
with restricted Dyck paths and ordered trees that transports some statistics.
