o rZh@sddlmZdddZdS))wordnetNengcsZt||durtj||d}rfdd|D}|sdStfdd|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. :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('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 N)langcs g|] }t|kr|qS)strpos.0ss)rr7/var/www/auris/lib/python3.10/site-packages/nltk/wsd.py +s zlesk..c3s*|]}t||fVqdS)N)len intersectionZ definitionsplitr)contextrr 0s zlesk..)setrsynsetsmax)Zcontext_sentenceZambiguous_wordrrr_Zsenser)rrr lesk s  r)NNr)Z nltk.corpusrrrrrr s