# Word sense disambiguation: Lesk, Walker and graph methods

Subject: Natural Language Processing

Exam: TEE

Reader: https://deep-learning-study-room.vercel.app/nlp/#tee/read/u5-wsd

Canonical: https://deep-learning-study-room.vercel.app/read/nlp/tee/read-chapter/u5-wsd/

Unit 5 · PDF pages 23–48

1. [What WSD solves and how approaches differ](https://deep-learning-study-room.vercel.app/read/nlp/tee/read/u5-wsd--u5-wsd-basics/)
2. [Lesk algorithm, from words to overlap scores](https://deep-learning-study-room.vercel.app/read/nlp/tee/read/u5-wsd--u5-lesk/)
3. [Thesaurus / Walker approach, with three complete examples](https://deep-learning-study-room.vercel.app/read/nlp/tee/read/u5-wsd--u5-walker/)
4. [Random-walk WSD and supervised alternatives](https://deep-learning-study-room.vercel.app/read/nlp/tee/read/u5-wsd--u5-graph/)