'[fddlmZddZdS))wordnetNct||tj|}rfd|D}|sdStfd|D\}}|S)aReturn a synset for an ambiguous word in a context. :param iter context_sentence: The context sentence where the ambiguous word occurs, passed as an iterable of words. :param str ambiguous_word: The ambiguous word that requires WSD. :param str pos: A specified Part-of-Speech (POS). :param iter synsets: Possible synsets of the ambiguous word. :return: ``lesk_sense`` The Synset() object with the highest signature overlaps. This function is an implementation of the original Lesk algorithm (1986) [1]. Usage example:: >>> lesk(['I', 'went', 'to', 'the', 'bank', 'to', 'deposit', 'money', '.'], 'bank', 'n') Synset('savings_bank.n.02') [1] Lesk, Michael. "Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone." Proceedings of the 5th Annual International Conference on Systems Documentation. ACM, 1986. https://dl.acm.org/citation.cfm?id=318728 Nc^g|])}t|k'|*S)strpos).0ssrs zlesk..*s1@@@"3rvvxx==C+?+?2+?+?+?c3K|]L}t||fVMdS)N)len intersection definitionsplit)r r contexts r zlesk../scEGW ! !"--//"7"7"9"9 : : ; ;R@r )setrsynsetsmax)context_sentenceambiguous_wordrr_sensers ` @r leskr s0"##G/.11 A@@@@@@@ tKRHAu Lr )NN) nltk.corpusrrrr r rs7 &&&&&&r