a
     ˜ëj&  ã                   @   s˜   d dl Z d dlmZ d dlmZ d dlmZ zd dlZW n eyJ   Y n0 d dl	m
Z
 G dd„ de
ƒZdd	„ Zd
d„ ZG dd„ dƒZG dd„ dƒZdS )é    N)Úabstractmethod)Úsqrt)Ústdout)ÚClusterIc                   @   sd   e Zd ZdZddd„Zddd„Zedd	„ ƒZd
d„ Zedd„ ƒZ	dd„ Z
dd„ Zdd„ Zdd„ ZdS )ÚVectorSpaceClustererz©
    Abstract clusterer which takes tokens and maps them into a vector space.
    Optionally performs singular value decomposition to reduce the
    dimensionality.
    FNc                 C   s   d| _ || _|| _dS )a)  
        :param normalise:       should vectors be normalised to length 1
        :type normalise:        boolean
        :param svd_dimensions:  number of dimensions to use in reducing vector
                                dimensionsionality with SVD
        :type svd_dimensions:   int
        N)Ú_TtÚ_should_normaliseÚ_svd_dimensions)ÚselfZ	normaliseZsvd_dimensions© r   úP/mnt/bigstor/www/usecases/.venv/lib/python3.9/site-packages/nltk/cluster/util.pyÚ__init__   s    zVectorSpaceClusterer.__init__c           
         sê   t |ƒdksJ ‚ˆ jr&ttˆ j|ƒƒ}ˆ jrÄˆ jt |d ƒk rÄtj t 	t 
|¡¡¡\}}}|d ˆ j… t ˆ jtj¡ }|d d …d ˆ j…f }|d ˆ j…d d …f }	t 	t ||	¡¡}t 	|¡ˆ _ˆ  ||¡ |ræ‡ fdd„|D ƒS d S )Nr   c                    s   g | ]}ˆ   |¡‘qS r   )Úclassify)Ú.0Úvector©r
   r   r   Ú
<listcomp>?   ó    z0VectorSpaceClusterer.cluster.<locals>.<listcomp>)Úlenr   ÚlistÚmapÚ
_normaliser	   ÚnumpyZlinalgZsvdZ	transposeÚarrayÚidentityÚfloat64Údotr   Úcluster_vectorspace)
r
   ÚvectorsZassign_clustersÚtraceÚuÚdZvtÚSÚTZDtr   r   r   Úcluster(   s    ÿzVectorSpaceClusterer.clusterc                 C   s   dS )zD
        Finds the clusters using the given set of vectors.
        Nr   )r
   r   r   r   r   r   r   A   s    z(VectorSpaceClusterer.cluster_vectorspacec                 C   s<   | j r|  |¡}| jd ur(t | j|¡}|  |¡}|  |¡S ©N)r   r   r   r   r   Úclassify_vectorspaceZcluster_name)r
   r   r$   r   r   r   r   G   s    


zVectorSpaceClusterer.classifyc                 C   s   dS )zN
        Returns the index of the appropriate cluster for the vector.
        Nr   ©r
   r   r   r   r   r&   O   s    z)VectorSpaceClusterer.classify_vectorspacec                 C   s4   | j r|  |¡}| jd ur(t | j|¡}|  ||¡S r%   )r   r   r   r   r   Úlikelihood_vectorspace)r
   r   Úlabelr   r   r   Ú
likelihoodU   s
    

zVectorSpaceClusterer.likelihoodc                 C   s   |   |¡}||krdS dS )zP
        Returns the likelihood of the vector belonging to the cluster.
        g      ð?g        )r&   )r
   r   r$   Z	predictedr   r   r   r(   \   s    
z+VectorSpaceClusterer.likelihood_vectorspacec                 C   s,   | j r|  |¡}| jdur(t | j|¡}|S )zU
        Returns the vector after normalisation and dimensionality reduction
        N)r   r   r   r   r   r'   r   r   r   r   c   s
    

zVectorSpaceClusterer.vectorc                 C   s   |t t ||¡ƒ S )z7
        Normalises the vector to unit length.
        ©r   r   r   r'   r   r   r   r   m   s    zVectorSpaceClusterer._normalise)FN)FF)Ú__name__Ú
__module__Ú__qualname__Ú__doc__r   r$   r   r   r   r&   r*   r(   r   r   r   r   r   r   r      s   




r   c                 C   s   | | }t t ||¡ƒS )z}
    Returns the euclidean distance between vectors u and v. This is equivalent
    to the length of the vector (u - v).
    r+   )r    ÚvÚdiffr   r   r   Úeuclidean_distancet   s    r2   c                 C   s0   dt  | |¡tt  | | ¡ƒtt  ||¡ƒ   S )zw
    Returns 1 minus the cosine of the angle between vectors v and u. This is
    equal to ``1 - (u.v / |u||v|)``.
    é   )r   r   r   )r    r0   r   r   r   Úcosine_distance}   s    r4   c                   @   s2   e Zd ZdZdd„ Zddd„Zdd„ Zd	d
„ ZdS )Ú_DendrogramNodezTree node of a dendrogram.c                 G   s   || _ || _d S r%   )Ú_valueÚ	_children)r
   ÚvalueÚchildrenr   r   r   r   ˆ   s    z_DendrogramNode.__init__Tc                 C   s@   | j r*g }| j D ]}| | |¡¡ q|S |r6| jgS | gS d S r%   )r7   ÚextendÚleavesr6   )r
   Úvaluesr;   Úchildr   r   r   r;   Œ   s    
z_DendrogramNode.leavesc                 C   sš   | j | fg}t|ƒ|k rv| ¡ \}}|js:| ||f¡ qv|jD ]*}|jr\| |j |f¡ q@| d|f¡ q@| ¡  qg }|D ]\}}| | ¡ ¡ q~|S ©Nr   )r6   r   Úpopr7   ÚpushÚappendÚsortr;   )r
   ÚnÚqueueÚpriorityÚnoder=   Úgroupsr   r   r   rG   —   s    

z_DendrogramNode.groupsc                 C   s   t | j|jƒdk S r>   )r4   r6   )r
   Z
comparatorr   r   r   Ú__lt__¬   s    z_DendrogramNode.__lt__N)T)r,   r-   r.   r/   r   r;   rG   rH   r   r   r   r   r5   …   s
   
r5   c                   @   s@   e Zd ZdZg fdd„Zdd„ Zdd„ Zg fdd	„Zd
d„ ZdS )Ú
Dendrograma  
    Represents a dendrogram, a tree with a specified branching order.  This
    must be initialised with the leaf items, then iteratively call merge for
    each branch. This class constructs a tree representing the order of calls
    to the merge function.
    c                 C   s(   dd„ |D ƒ| _ t | j ¡| _d| _dS )zs
        :param  items: the items at the leaves of the dendrogram
        :type   items: sequence of (any)
        c                 S   s   g | ]}t |ƒ‘qS r   )r5   ©r   Úitemr   r   r   r   ½   r   z'Dendrogram.__init__.<locals>.<listcomp>r3   N)Ú_itemsÚcopyÚ_original_itemsÚ_merge)r
   Úitemsr   r   r   r   ¸   s    zDendrogram.__init__c                    sj   t |ƒdksJ ‚tˆ jg‡ fdd„|D ƒ¢R Ž }ˆ  jd7  _|ˆ j|d < |dd… D ]}ˆ j|= qXdS )a=  
        Merges nodes at given indices in the dendrogram. The nodes will be
        combined which then replaces the first node specified. All other nodes
        involved in the merge will be removed.

        :param  indices: indices of the items to merge (at least two)
        :type   indices: seq of int
        é   c                 3   s   | ]}ˆ j | V  qd S r%   )rL   )r   Úir   r   r   Ú	<genexpr>Ë   r   z#Dendrogram.merge.<locals>.<genexpr>r3   r   N)r   r5   rO   rL   )r
   ÚindicesrF   rR   r   r   r   ÚmergeÁ   s    	 zDendrogram.mergec                 C   s8   t | jƒdkr$t| jg| j¢R Ž }n
| jd }| |¡S )z’
        Finds the n-groups of items (leaves) reachable from a cut at depth n.
        :param  n: number of groups
        :type   n: int
        r3   r   )r   rL   r5   rO   rG   )r
   rC   Úrootr   r   r   rG   Ñ   s    
zDendrogram.groupsc                    s0  d\}}}t | jƒdkr.t| jg| j¢R Ž }n
| jd }| j}|rH|}ndd„ |D ƒ}ttt |ƒƒd ‰ˆd ‰tˆˆ d ƒ‰d‡‡fdd	„	‰ d
d„ }|j|fg}	‡ fdd„|D ƒ}
|	�r|	 	¡ \}}t
tdd„ |jƒƒ}t
t|j|ƒƒ}|�rt|ƒ}t|ƒ}tt |ƒƒD ]¤}|| |v �rv||k�r<|ˆ |d|ƒƒ n,||k�rX|ˆ ||dƒƒ n|ˆ |||ƒƒ ˆ |ƒ|
|< n:||  k�rŽ|k�r¤n n|ˆ |||ƒƒ n||
| ƒ �q|dƒ |jD ]}|j�rÂ|	 |j|f¡ �qÂ|	 ¡  |
D ]}||ƒ �qî|dƒ q¶|d ‡fdd„|D ƒ¡ƒ |dƒ dS )zØ
        Print the dendrogram in ASCII art to standard out.

        :param leaf_labels: an optional list of strings to use for labeling the
                            leaves
        :type leaf_labels: list
        )ú+ú-ú|r3   r   c                 S   s   g | ]}d |j  ‘qS )z%s)r6   ©r   Zleafr   r   r   r   ó   r   z#Dendrogram.show.<locals>.<listcomp>rQ   ú c                    s   ˆ | › | › |ˆ › �S r%   r   )ZcentreÚleftÚright)ÚlhalfÚrhalfr   r   Úformatû   s    zDendrogram.show.<locals>.formatc                 S   s   t  | ¡ d S r%   )r   Úwrite)Ústrr   r   r   Údisplayþ   s    z Dendrogram.show.<locals>.displayc                    s   g | ]}ˆ d ƒ‘qS )r[   r   rZ   )r`   r   r   r     r   c                 S   s   |   d¡d S )NFr   )r;   )Úcr   r   r   Ú<lambda>  r   z!Dendrogram.show.<locals>.<lambda>Ú
Ú c                 3   s   | ]}|  ˆ ¡V  qd S r%   )ÚcenterrJ   )Úwidthr   r   rS   #  r   z"Dendrogram.show.<locals>.<genexpr>N)r[   r[   )r   rL   r5   rO   rN   Úmaxr   Úintr6   r?   r   r7   ÚindexÚminÚrangerA   rB   Újoin)r
   Zleaf_labelsZJOINZHLINKZVLINKrV   r;   Zlast_rowrc   rD   Z	verticalsrE   rF   Zchild_left_leafrT   Úmin_idxZmax_idxrR   r=   Zverticalr   )r`   r^   r_   ri   r   ÚshowÝ   sV    






zDendrogram.showc                 C   sD   t | jƒdkr$t| jg| j¢R Ž }n
| jd }| d¡}dt |ƒ S )Nr3   r   Fz<Dendrogram with %d leaves>)r   rL   r5   rO   r;   )r
   rV   r;   r   r   r   Ú__repr__&  s
    

zDendrogram.__repr__N)	r,   r-   r.   r/   r   rU   rG   rq   rr   r   r   r   r   rI   °   s   	IrI   )rM   Úabcr   Úmathr   Úsysr   r   ÚImportErrorZnltk.cluster.apir   r   r2   r4   r5   rI   r   r   r   r   Ú<module>   s   _	+