Understanding the Yarowsky algorithm

DOI10.1162/0891201041850876MaRDI QIDQ3225418zbMATH OpenOpenAlexFDO

Authors Steven Abney

Publication date 20 March 2012

Published in Computational Linguistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1162/0891201041850876

zbMATH Keywords

bootstrapping algorithmobjective functionYarowsky algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50) Linguistics (91F20)

Recommendations

• Semisupervised Learning for Computational Linguistics
• scientific article; zbMATH DE number 1615267
• Topic models application to word sense ambiguity
• How can grammatical inference contribute to computational linguistics?
• Algorithms for minimally supervised learning

Cited in

(4)

• On multi-view learning with additive models
• Anchored Bayesian Gaussian mixture models
• Robust semi-supervised least squares classification by implicit constraints
• Semi-supervised learning using ensembles of multiple 1D-embedding-based label boosting

This page was built for publication: Understanding the Yarowsky algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225418)