To illustrate, I just generated a 15-page paper entitled “Stochastically Dependent Algebras for a Simply Ordered Curve,” by N. Kobayashi and A. Ramanujan. Its abstract reads:
Let us assume $| \iota | \cong \aleph_0$. We wish to extend the results of  to monoids. We show that every discretely quasi-nonnegative arrow acting compactly on an essentially left-Cayley isometry is almost associative, parabolic and partial. Next, in future work, we plan to address questions of uniqueness as well as stability. It was Fibonacci-Frobenius who first asked whether sub-completely super-Jacobi curves can be computed.
Go try it out, and generate a couple for yourself. Also linked from that page are more info about the program, source code, and links to randomly generated books you can buy.