Latent Dirichlet Allocation Using 'tidyverse' Conventions

Implements an algorithm for Latent Dirichlet Allocation (LDA), Blei et at. (2003) <>, using style conventions from the 'tidyverse', Wickham et al. (2019), and 'tidymodels', Kuhn et al.<>. Fitting is done via collapsed Gibbs sampling. Also implements several novel features for LDA such as guided models and transfer learning based on ongoing and, as yet, unpublished research.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.0.1 by Tommy Jones, 3 months ago

Report a bug at

Browse source code at

Authors: Tommy Jones [aut, cre] , Brendan Knapp [ctb] , Barum Park [ctb]

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports dplyr, generics, gtools, Matrix, methods, mvrsquared, Rcpp, rlang, stats, stringr, textmineR, tibble, tidyr, tidytext

Suggests knitr, parallel, quanteda, testthat, tm, spelling

Linking to Rcpp, RcppArmadillo, RcppProgress, RcppThread

System requirements: C++11

See at CRAN