a
     ˜ëj  ã                   @   s   d dl mZ ddd„ZdS )é    )ÚwordnetNÚengc                    sT   t | ƒ‰ |du rtj||d�}ˆr4‡fdd„|D ƒ}|s<dS t|‡ fdd„d�}|S )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                    s    g | ]}t | ¡ ƒˆ kr|‘qS © )ÚstrÚpos)Ú.0Úss)r   r   úG/mnt/bigstor/www/usecases/.venv/lib/python3.9/site-packages/nltk/wsd.pyÚ
<listcomp>+   ó    zlesk.<locals>.<listcomp>c                    s   t ˆ  |  ¡  ¡ ¡ƒS )N)ÚlenÚintersectionZ
definitionÚsplit)r	   )Úcontextr   r
   Ú<lambda>1   r   zlesk.<locals>.<lambda>)Úkey)Úsetr   ÚsynsetsÚmax)Zcontext_sentenceZambiguous_wordr   r   r   Zsenser   )r   r   r
   Úlesk   s    ÿr   )NNr   )Znltk.corpusr   r   r   r   r   r
   Ú<module>
   s   