Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Yarowsky algorithm

In computational linguistics the Yarowsky algorithm is an unsupervised learning algorithm for word sense disambiguation that uses the "one sense per… Expand
Wikipedia

Related topics

Related topics

14 relations
AlgorithmAutomatic acquisition of sense-tagged corporaCollocationComputational linguistics
Expand

Broader (1)

Corpus linguistics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Word sense disambiguation based on yarowsky approach in english quranic information retrieval system
Word sense disambiguation (WSD) is the process of eliminating ambiguity that lies on some words by identifying the exact sense of… Expand
  • figure 1
  • table 1
  • table 3
  • table 4
  • table 8
Is this relevant?
2014
2014
전체증거 이론과 Bootstrapping
김기현 교수님에 따르면, 의견 불일치 문제에 대해서 최근 토마스 켈리에 의해 발전된 전체증거 이론은 Bootstrapping… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2012
2012
Bootstrapping via Graph Propagation
Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via… Expand
  • table 2
  • figure 1
  • figure 2
  • figure 3
  • table 3
Is this relevant?
2009
2009
The bootstrapping of the Yarowsky algorithm in real corpora
The Yarowsky bootstrapping algorithm resolves the homograph-level word sense disambiguation (WSD) problem, which is the sense… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2009
2009
The bootstrapping of the Yarowsky algorithm in real corpora
The Yarowsky bootstrapping algorithm resolves the homograph-level word sense disambiguation (WSD) problem, which is the sense… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Analysis of Semi-Supervised Learning with the Yarowsky Algorithm
The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in… Expand
  • figure 1
Is this relevant?
2007
2007
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Understanding the Yarowsky Algorithm
Many problems in computational linguistics are well suited for bootstrapping (semisupervised learning) techniques. The Yarowsky… Expand
Is this relevant?
2004
2004
Understanding the Yarowsky Algorithm
Many problems in computational linguistics are well suited for bootstrapping (semisupervised learning) techniques. The Yarowsky… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Bootstrapping
This paper refines the analysis of cotraining, defines and evaluates a new co-training algorithm that has theoretical… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE