পদ্ধতির তুলনা করুন

	পাঠযোগ্যতা বিশ্লেষণ	Text Classification
ক্ষেত্র	টেক্সট খনন	টেক্সট খনন
পরিবার	Process / pipeline	Process / pipeline
উদ্ভবের বছর	1975	—
প্রবর্তক	J. Peter Kincaid et al.	—
ধরন	Text-mining readability scoring task	Supervised NLP classification task
মৌলিক উৎস	Kincaid, J.P., Fishburne, R.P., Rogers, R.L. & Chissom, B.S. (1975). Derivation of New Readability Formulas for Navy Enlisted Personnel. Naval Technical Training Command.	Joachims, T. (1998). Text Categorization with Support Vector Machines: Learning with Many Relevant Features. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer.
অপর নাম	readability scoring, readability formulas, Flesch-Kincaid analysis, Okunabilirlik Analizi	text categorization, document classification, topic classification, metin sınıflandırma
সম্পর্কিত	3	4
সারসংক্ষেপ	Readability analysis measures how well a text suits its intended audience by applying established readability formulas such as Flesch-Kincaid and Gunning Fog. The modern formula family was derived by Kincaid and colleagues in 1975, and it turns prose into a single score or target reading-grade level that signals how easy the text is to read.	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.