+ ÖÇÜhãó€^RIHtRRltR#)é)ÚwordnetNcóa€\V4oVf\P!WR7pV'd2VUu.uF%p\VP 44V8XgK#VNK' ppV'gR#\ VV3RlR7pV#uupi)aÔReturn 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. :param str lang: WordNet language. :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('depository_financial_institution.n.01') [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 N)Úlangcóp<€\SPVP4P444#)N)ÚlenÚ intersectionÚ definitionÚsplit)ÚssÚcontexts&€Ú*/usr/lib/python3/dist-packages/nltk/wsd.pyÚÚlesk..1s$ø€¤ G×$8Ñ$8¸¿¹»×9NÑ9NÓ9PÓ$QÔ Ró)Úkey)ÚsetrÚsynsetsÚstrÚposÚmax)Úcontext_sentenceÚambiguous_wordrrrr Úsenser s&&&&& @r Úleskr spø€ô2Ð"Ó#€GØ‚Ü—/’/ .Ô<ˆç Ù 'Ó@¡˜"¬3¨r¯v©v«x«=¸CÑ+?—22¡ˆÐ@ç Ùä ØÔRô €Eð €LùòAs ´ A>ÁA>)NNÚeng)Ú nltk.corpusrr©rr Úrsðõ ö'r