Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,922,993 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Algorithm
Automatic acquisition of sense-tagged corpora
Collocation
Computational 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
Omar Mohamed
,
S. Tiun
2015
Corpus ID: 64535934
Word sense disambiguation (WSD) is the process of eliminating ambiguity that lies on some words by identifying the exact sense of…
Expand
2012
2012
Bootstrapping via Graph Propagation
M. Whitney
,
Anoop Sarkar
Annual Meeting of the Association for…
2012
Corpus ID: 1965764
Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via…
Expand
2012
2012
An Investigation to Semi supervised approach for HINDI Word sense disambiguation
N. Mishra
,
Tanveer J. Siddiqui
2012
Corpus ID: 1113354
This paper investigates yarowsky algorithm for Hindi word sense disambiguation. The evaluation has been developed o n a manually…
Expand
2009
2009
The bootstrapping of the Yarowsky algorithm in real corpora
Ricardo Sánchez-de-Madariaga
,
José Raúl Fernández del Castillo Díez
Information Processing & Management
2009
Corpus ID: 36631546
Highly Cited
2007
Highly Cited
2007
Analysis of Semi-Supervised Learning with the Yarowsky Algorithm
Gholamreza Haffari
,
Anoop Sarkar
Conference on Uncertainty in Artificial…
2007
Corpus ID: 904344
The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in…
Expand
2007
2007
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
David A. Smith
,
Jason Eisner
Conference on Empirical Methods in Natural…
2007
Corpus ID: 2238974
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text…
Expand
Highly Cited
2004
Highly Cited
2004
Understanding the Yarowsky Algorithm
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…
Expand
2003
2003
Language model adaptation using cross-lingual information
Woosung Kim
,
S. Khudanpur
Interspeech
2003
Corpus ID: 1862811
The success of statistical language modeling techniques is crucially dependent on the availability of a large amount training…
Expand
Highly Cited
2002
Highly Cited
2002
Bootstrapping
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE