Share of distinct words among the n_terms most probable
words of all topics (Dieng, Ruiz and Blei 2020):
$$\mathrm{TD} = \frac{|\bigcup_k \mathrm{top}_n(k)|}{nK} \in [1/K, 1].$$
Close to 1, topics are described by different words; low values reveal
redundant topics (several topics on the same theme), which often appear
when K is too large.
References
Dieng, A. B., Ruiz, F. J. R. and Blei, D. M. (2020). Topic modeling in embedding spaces. Transactions of the Association for Computational Linguistics, 8, 439-453. doi:10.1162/tacl_a_00325
