ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Tekstutfylling×Tekstklassifisering×
FagfeltTekstutvinningTekstutvinning
FamilieProcess / pipelineProcess / pipeline
Opprinnelsesår1953 (cloze); 2019 (neural span infilling)
OpphavspersonWilson L. Taylor (cloze procedure, 1953); modern span infilling by Zhu et al. (2019)
TypeNLP conditional text generation taskSupervised NLP classification task
Opprinnelig kildeTaylor, W.L. (1953). Cloze Procedure: A New Tool for Measuring Readability. Journalism Quarterly, 30(4), 415-433. 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 ↗
Aliascloze procedure, cloze test, masked language modeling, span infillingtext categorization, document classification, topic classification, metin sınıflandırma
Relaterte44
SammendragText infilling is a natural-language-processing task that completes missing words, phrases, or spans in a document by exploiting the surrounding context. Introduced as the cloze procedure by Wilson L. Taylor in 1953 as a readability measure, it was reformulated for neural models by Zhu et al. (2019) and is now used for data augmentation, writing assistance, and language-model evaluation.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.
ScholarGateDatasett
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Text Infilling · Text Classification. Hentet 2026-06-17 fra https://scholargate.app/no/compare