References
- Benoit, K. , Muhr, D. , and Watanabe, K. (2019), stopwords: Multilingual Stopword Lists , available at: https://CRAN.R-project.org/package=stopwords.Rpackageversion 1.0.
- Blei, D. M. , Ng, A. Y. , and Jordan, M. I. (2003), “Latent Dirichlet Allocation,” Journal of Machine Learning Research , 3(Jan):993–1022.
- Chatterjee, S. , and Diaconis, P. (2017), “A Central Limit Theorem for a New Statistic on Permutations,” Indian Journal of Pure and Applied Mathematics , 48, 561–573. DOI: https://doi.org/10.1007/s13226-017-0246-3.
- Henry, T. R. , Banks, D. , Owens-Oas, D. , and Chai, C. (2019), “Modeling Community Structure and Topics in Dynamic Text Networks,” Journal of Classification , 36, 322–349. DOI: https://doi.org/10.1007/s00357-018-9289-3.
- Hoeffding, W. (1951), “A Combinatorial Central Limit Theorem,” Annals of Mathematical Statistics , 22, 558–566. DOI: https://doi.org/10.1214/aoms/1177729545.
- Jagarlamudi, J. , Daumé III, H. , and Udupa, R. (2012), “Incorporating Lexical Priors Into Topic Models,” in Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics , pp. 204–213.
- Kim, Y. , and Shim, K. (2014), “Twilite: A Recommendation System for Twitter Using a Probabilistic Model Based on Latent Dirichlet Allocation,” Information Systems , 42, 59–77. DOI: https://doi.org/10.1016/j.is.2013.11.003.
- Porter, M. F. (2001), “Snowball: A Language for Stemming Algorithms.” Available at: http://snowball.tartarus.org/texts/introduction.html.
- Russell, S. , and Norvig, P. (2002), Artificial Intelligence: A Modern Approach , Upper Saddle River, NJ: Prentice Hall.
- Sidorov, G. (2019), Syntactic n-Grams in Computational Linguistics , New York: Springer.
- Soriano, J. , Au, T. , and Banks, D. (2013), “Text Mining in Computational Advertising,” Statistical Analysis and Data Mining: The ASA Data Science Journal , 6, 273–285. DOI: https://doi.org/10.1002/sam.11197.