השוואת שיטות

	Word2Vec	סיווג טקסט	TF-IDF
תחום	כריית טקסט	כריית טקסט	כריית טקסט
משפחה	Process / pipeline	Process / pipeline	Process / pipeline
שנת המקור	2013	—	1988
הוגה השיטה	Tomas Mikolov et al.	—	Salton & Buckley
סוג	Neural word-embedding model	Supervised NLP classification task	Text vectorization / term-weighting scheme
מקור מכונן	Mikolov, T., Chen, K., Corrado, G. & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space.	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.
כינויים	word embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime 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
תקציר	Word2Vec is a neural word-embedding technique introduced by Mikolov and colleagues in 2013 that maps each word in a text corpus to a dense numeric vector. Words that appear in similar contexts end up close together in the vector space, so the embeddings capture semantic similarity that can be measured arithmetically.	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.