1. Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., & Mohri, M. (2007). OpenFst: A general and efficient weighted finite-state transducer library. In J. Holub & J. Žd’árek (Eds.), Implementation and Application of Automata. 12th International Conference on Implementation and Application of Automata, CIAA 2007, Prague, July 2007. Revised Selected Papers. Lecture notes in computer science (vol. 4783, pp. 11–23). Springer.
2. Busa, R. (1974). Index Thomisticus: Sancti Thomae Aquinatis operum omnium indices et concordantiae in quibus verborum omnium et singulorum formae et lemmata cum suis frequentiis et contextibus variis modis referuntur. Frommann-Holzboog.
3. Busa, R. (1996). Thomae Aquinatis Opera omnia cum hypertextibus in CD-ROM. Editoria Elettronica Editel.
4. Busa, R. (2009). From punched cards to treebanks: 60 years of computational linguistics. In Website of the Eighth International Workshop on Treebanks and Linguistic Theories.
5. Church, K. W., & Mercer, R. L. (1993). Introduction to the special issue on computational linguistics using large corpora. Computational Linguistics, 19(1), 1–24.