Skip to content


Subversion checkout URL

You can clone with
Download ZIP
A Ruby wrapper for Latent Dirichlet Allocation (LDA).
C Ruby Makefile C++
Failed to load latest commit information.
ext/lda-ruby Added function prototypes to resolve error
lib some minor code refinements and version bump for gem
.gitignore Version bump to 0.3.5 some minor code refinements and version bump for gem some minor code refinements and version bump for gem
Rakefile Added stopwords list and downcased all text
VERSION.yml some minor code refinements and version bump for gem
license.txt importing code

Latent Dirichlet Allocation – Ruby Wrapper

What is LDA-Ruby?

This wrapper is based on C-code by David M. Blei. In a nutshell, it can be used to automatically cluster documents into topics. The number of topics are chosen beforehand and the topics found are usually fairly intuitive. Details of the implementation can be found in the paper by Blei, Ng, and Jordan.

The original C code relied on files for the input and output. We felt it was necessary to depart from that model and use Ruby objects for these steps instead. The only file necessary will be the data file (in a format similar to that used by SVMlight). Optionally you may need a vocabulary file to be able to extract the words belonging to topics.

Example usage:

require 'lda-ruby'
corpus ="data/data_file.dat")
lda =    # create an Lda object for training
lda.em("random")              # run EM algorithm using random starting points
lda.print_topics(20)          # print all topics with up to 20 words per topic

If you have general questions about Latent Dirichlet Allocation, I urge you to use the topic models mailing list, since the people who monitor that are very knowledgeable. If you encounter bugs specific to lda-ruby, please post an issue on the Github project.



Blei, David M., Ng, Andrew Y., and Jordan, Michael I. 2003. Latent dirichlet allocation. Journal of Machine Learning Research. 3 (Mar. 2003), 993-1022 [pdf].

Something went wrong with that request. Please try again.