Natural Language Processing · TEE · read-chapter

Word sense disambiguation: Lesk, Walker and graph methods

Unit 5 · PDF pages 23–48

  1. What WSD solves and how approaches differ
  2. Lesk algorithm, from words to overlap scores
  3. Thesaurus / Walker approach, with three complete examples
  4. Random-walk WSD and supervised alternatives