1. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87–106. https://doi.org/10.1016/0890-5401(87)90052-6.
2. Black, E., Jelinek, F., Lafrerty, J., Magerman, D. M., Mercer, R., & Roukos S. (1993). Towards history-based grammars: Using richer models for probabilistic parsing. In 31st annual meeting of the association for computational linguistics, association for computational linguistics, Columbus, Ohio, USA (pp. 31–37). https://doi.org/10.3115/981574.981579. https://www.aclweb.org/anthology/P93-1005.
3. Blunsom, P., & Cohn, T. (2010). Inducing synchronous grammars with slice sampling. In Human language technologies: The 2010 annual conference of the North American chapter of the association for computational linguistics, association for computational linguistics, Los Angeles, California (pp. 238–241). https://www.aclweb.org/anthology/N10-1028.
4. Blunsom, P., Cohn, T. (2011). A hierarchical Pitman–Yor process HMM for unsupervised part of speech induction. In Proceedings of the 49th annual meeting of the association for computational linguistics (pp. 865–874).
5. Clark, A. (2003). Combining distributional and morphological information for part of speech induction. Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics, 1, 59–66.