ScholarGate
Ассистент

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

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Анализ удобочитаемости×Классификация текстов×
ОбластьИнтеллектуальный анализ текстаИнтеллектуальный анализ текста
СемействоProcess / pipelineProcess / pipeline
Год появления1975
Автор методаJ. Peter Kincaid et al.
ТипText-mining readability scoring taskSupervised 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. link ↗Joachims, T. (1998). Text Categorization with Support Vector Machines: Learning with Many Relevant Features. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer. DOI ↗
Другие названияreadability scoring, readability formulas, Flesch-Kincaid analysis, Okunabilirlik Analizitext categorization, document classification, topic classification, metin sınıflandırma
Связанные34
Сводка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.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Readability Analysis · Text Classification. Получено 2026-06-15 из https://scholargate.app/ru/compare