\begin{rmdnote}
Note that this is a visualization of a \textbf{Markov chain}, a common
model in text processing. In a Markov chain, each choice of word depends
only on the previous word. In this case, a random generator following
this model might spit out ``dear'', then ``sir'', then
``william/walter/thomas/thomas's'', by following each word to the most
common words that follow it. To make the visualization interpretable, we
chose to show only the most common word to word connections, but one
could imagine an enormous graph representing all connections that occur
in the text.
\end{rmdnote}