Сравнение на методи

	BERT Embeddings	Класификация на текст	TF-IDF
Област	Извличане на текст	Извличане на текст	Извличане на текст
Семейство	Process / pipeline	Process / pipeline	Process / pipeline
Година на възникване	2019	—	1988
Създател	Devlin, Chang, Lee & Toutanova (Google AI)	—	Salton & Buckley
Тип	Contextual transformer text-representation method	Supervised NLP classification task	Text vectorization / term-weighting scheme
Основополагащ източник	Devlin, J., Chang, M.-W., Lee, K. & Toutanova, K. (2019). BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. NAACL-HLT, 4171-4186.	Joachims, T. (1998). Text Categorization with Support Vector Machines: Learning with Many Relevant Features. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer.	Salton, G. & Buckley, C. (1988). Term-weighting approaches in automatic text retrieval. Information Processing & Management, 24(5), 513-523.
Други названия	contextual embeddings, transformer embeddings, BERT Tabanlı Metin Gömülmeleri	text categorization, document classification, topic classification, metin sınıflandırma	term weighting, tf-idf weighting, TF-IDF Vektörizasyonu
Свързани	4	4	3
Резюме	BERT-based text embeddings, introduced by Devlin and colleagues at Google AI in 2019, turn text into context-sensitive dense vectors using a bidirectional Transformer encoder. Because the meaning of a word shifts with its context, BERT produces richer representations than static methods such as Word2Vec or topic models like LDA.	Text classification, also called text categorization, is a supervised natural-language-processing task that automatically assigns documents to predefined categories. Building on the support-vector-machine approach to text categorization established by Joachims (1998) and consolidated in the text-mining literature by Aggarwal and Zhai (2012), it powers tasks such as spam detection and topic classification by learning from labelled examples.	TF-IDF, introduced by Salton and Buckley (1988), is a term-weighting scheme that scores each word in a document by how often it appears there and how rare it is across the whole collection. It turns raw text into weighted document vectors, giving high weight to terms that are frequent in one document but uncommon elsewhere.