Порівняння методів

	Слабокерована тематична модель LDA	Векторні представлення речень
Галузь	Глибоке навчання	Глибоке навчання
Родина	Machine learning	Machine learning
Рік появи	2009–2012	2015–2019
Автор методу	Jagarlamudi et al.; Andrzejewski et al.	Kiros et al. (Skip-Thought, 2015); Reimers & Gurevych (Sentence-BERT, 2019)
Тип	Probabilistic generative model with weak supervision	Representation learning / embedding
Основоположне джерело	Jagarlamudi, J., Daume III, H., & Udupa, R. (2012). Incorporating Lexical Priors into Topic Models. Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2012), pp. 204–213.	Reimers, N., & Gurevych, I. (2019). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3980–3990.
Інші назви	WS-LDA, Guided LDA, Seeded LDA, Constrained LDA	sentence vectors, sentence representations, SBERT, semantic sentence encoding
Пов'язані	6	4
Підсумок	Weakly Supervised LDA is an extension of Latent Dirichlet Allocation that incorporates lightweight human guidance — typically keyword seeds or must-link/cannot-link constraints — into the Dirichlet priors, steering learned topics toward domain-meaningful themes without requiring fully labeled documents. It sits between fully unsupervised LDA and supervised classification, making it well-suited to situations where labeling thousands of documents is impractical.	Sentence Embeddings convert a sentence or short text into a single fixed-length dense vector that captures its semantic meaning. These vectors allow downstream tasks — semantic similarity, clustering, retrieval, and classification — to operate on numerical representations instead of raw text, making them one of the most versatile building blocks in modern NLP pipelines.