This document summarizes a survey on unsupervised graph-based word sense disambiguation. It introduces word sense disambiguation and the difference between supervised and unsupervised approaches. It then discusses the state of the art in graph-based word sense disambiguation, including methods like semantic graph construction, PageRank, HITS, and P-Rank. The document describes experiments on Senseval 2 and 3 data sets comparing different graph-based methods. It concludes that recent unsupervised systems minimize the gap with supervised approaches and future work could implement P-Rank using different graph representations.