▁previous ▁definitions ▁and ▁so ▁on . ▁Finally , ▁the ▁first ▁word ▁is ▁dis ambigu ated ▁by ▁selecting ▁the ▁semantic ▁variant ▁which ▁minim izes ▁the ▁distance ▁from ▁the ▁first ▁to ▁the ▁second ▁word . ▁ ▁An ▁alternative ▁to ▁the ▁use ▁of ▁the ▁definitions ▁is ▁to ▁consider ▁general ▁word - s ense ▁related ness ▁and ▁to ▁compute ▁the ▁semantic ▁similarity ▁of ▁each ▁pair ▁of ▁word ▁sens es ▁based ▁on ▁a ▁given ▁lex ical ▁knowledge ▁base ▁such ▁as ▁Word Net . ▁Graph - based ▁methods ▁rem in is cent ▁of ▁spread ing ▁activation ▁research ▁of ▁the ▁early ▁days ▁of ▁A I ▁research ▁have ▁been ▁applied ▁with ▁some ▁success . ▁More ▁complex ▁graph - based ▁approaches ▁have ▁been ▁shown ▁to ▁perform ▁almost ▁as ▁well ▁as ▁super vised ▁methods ▁or ▁even ▁out perform ing ▁them ▁on ▁specific ▁domains . ▁Rec ently , ▁it ▁has ▁been ▁reported ▁that ▁simple ▁graph ▁connect ivity ▁measures , ▁such ▁as ▁degree , ▁perform ▁state - of - the - art ▁W SD ▁in ▁the ▁presence ▁of ▁a ▁sufficiently ▁rich ▁lex ical ▁knowledge ▁base . ▁Also , ▁automatically ▁transfer ring ▁knowledge ▁in ▁the ▁form ▁of ▁semantic ▁relations ▁from ▁Wikipedia ▁to ▁Word Net ▁has ▁been ▁shown ▁to ▁boost ▁simple ▁knowledge - based ▁methods , ▁en abling ▁them ▁to ▁rival ▁the ▁best ▁super vised ▁systems ▁and ▁even ▁out perform ▁them ▁in ▁a ▁domain - specific ▁setting . ▁ ▁The ▁use ▁of ▁selection al ▁prefer ences ▁( or ▁selection al ▁restrictions ) ▁is ▁also ▁useful , ▁for ▁example , ▁knowing ▁that ▁one ▁typically ▁cook s ▁food ,