Skip to search formSkip to main contentSkip to account menu

Yarowsky algorithm

In computational linguistics the Yarowsky algorithm is an unsupervised learning algorithm for word sense disambiguation that uses the "one sense per… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Word sense disambiguation (WSD) is the process of eliminating ambiguity that lies on some words by identifying the exact sense of… 
2012
2012
Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via… 
2012
2012
This paper investigates yarowsky algorithm for Hindi word sense disambiguation. The evaluation has been developed o n a manually… 
Highly Cited
2007
Highly Cited
2007
The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in… 
2007
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text… 
Highly Cited
2004
Highly Cited
2004
  • Steven P. Abney
  • International Conference on Computational Logic
  • 2004
  • Corpus ID: 9955856
Many problems in computational linguistics are well suited for bootstrapping (semisupervised learning) techniques. The Yarowsky… 
2003
2003
The success of statistical language modeling techniques is crucially dependent on the availability of a large amount training… 
Highly Cited
2002
Highly Cited
2002
  • Steven P. Abney
  • Annual Meeting of the Association for…
  • 2002
  • Corpus ID: 208992094
This paper refines the analysis of cotraining, defines and evaluates a new co-training algorithm that has theoretical…