ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Classificació d'actes de diàleg×Classificació de text×
CampMineria de textMineria de text
FamíliaProcess / pipelineProcess / pipeline
Any d'origen1997–2000
Autor originalStolcke et al.; Jurafsky et al.
TipusNLP utterance-classification taskSupervised NLP classification task
Font seminalStolcke, A. et al. (2000). Dialogue Act Modeling for Automatic Tagging and Recognition of Conversational Speech. Computational Linguistics, 26(3), 339-373. DOI ↗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 ↗
Àliesdialogue act tagging, speech act classification, Diyalog Eylem Sınıflandırma (Dialogue Act Classification)text categorization, document classification, topic classification, metin sınıflandırma
Relacionats44
ResumDialogue act classification is a natural-language-processing task that automatically labels the communicative function of each utterance in a conversation — such as question, answer, greeting, or rejection. Consolidated by Jurafsky et al. (1997) and Stolcke et al. (2000), it is a foundational component for chatbots and discourse analysis.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.
ScholarGateConjunt de dades
  1. v1
  2. 2 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED

Ves a la cerca Baixa les diapositives

ScholarGateCompara mètodes: Dialogue Act Classification · Text Classification. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare