Unsupervised Word Sense Disambiguation Algorithm

An Unsupervised Word Sense Disambiguation Algorithm is a data-driven WSD algorithm that is an unsupervised classification algorithm and can be implemented by an unsupervised WSD system (to solve an unsupervised WSD task.

• Example(s):
  • Lesk Algorithm.
• Counter-Example(s):
  • Supervised Word Sense Disambiguation Algorithm.
• See: Heuristic WSD Algorithm.

---

---

References

2002

• (Banerjee, 2002) ⇒ Satanjeev Banerjee. (2002). “Adapting the Lesk algorithm for Word Sense Disambiguation to WordNet." Master’s thesis. Dept. of Computer Science, University of Minnesota, USA.

1995

• (Yarowsky, 1995) ⇒ David Yarowsky. (1995). “Unsupervised Word Sense Disambiguation Rivaling Supervised Methods." Proceedings of the 33rd annual meeting on Association for Computational Linguistics.

1986

• (Lesk, 1986) ⇒ Michael E. Lesk. (1986). “Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from a ice cream cone." Paper in: Proceedings of SIGDOC-1986.

---