Unsupervised Word Sense Disambiguation Rivaling Supervised Methods
Yarowsky, 1995, Unsupervised Word Sense Disambiguation Rivaling Supervised Methods (Proceedings of the 33rd Annual Meeting of ACL)
Subscriber deck — free during early access
2 cards in “6 Escaping from initial misclassifications” · whole deck
6 Escaping from initial misclassifications
- How does Yarowsky’s algorithm escape from initial misclassifications?Examples stay in a seed set only while their classification probability exceeds the threshold; if new evidence discredits the crucial collocate they return to the residual and may be relabelled. Language’s redundancy makes the process largely self-correcting.
- Yarowsky, 1995, Unsupervised Word Sense Disambiguation Rivaling Supervised Methods (Proceedings of the 33rd Annual Meeting of ACL), §6
- What techniques discourage wrong collocates from becoming entrenched?Incrementally widening the context window after intermediate convergence (adding new features to shake up the system), and randomly perturbing the inclusion threshold, similar to simulated annealing.
- Yarowsky, 1995, Unsupervised Word Sense Disambiguation Rivaling Supervised Methods (Proceedings of the 33rd Annual Meeting of ACL), §6
Source
- David Yarowsky. 1995. Unsupervised Word Sense Disambiguation Rivaling Supervised Methods. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, pp. 189–196. https://aclanthology.org/P95-1026/