o i &@sddlZddlmZddlmZddlmZzddlZWn ey%Ynwddl m Z Gddde Z dd Z d d Z Gd d d ZGdddZdS)N)abstractmethod)sqrt)stdout)ClusterIc@sdeZdZdZdddZdddZedd Zd d Zed d Z ddZ ddZ ddZ ddZ dS)VectorSpaceClustererz Abstract clusterer which takes tokens and maps them into a vector space. Optionally performs singular value decomposition to reduce the dimensionality. FNcCsd|_||_||_dS)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)self normalisesvd_dimensionsr L/var/www/edux/Edux_v2/venv/lib/python3.10/site-packages/nltk/cluster/util.py__init__s zVectorSpaceClusterer.__init__c st|dksJjrttj|}jrbjt|dkrbtjt t |\}}}|djt jtj }|dddjf}|djddf} t t || }t |_|||rsfdd|DSdS)Nrcsg|]}|qSr )classify).0vectorr r r ?z0VectorSpaceClusterer.cluster..)lenrlistmap _normaliser numpylinalgsvd transposearrayidentityfloat64dotrcluster_vectorspace) r vectorsassign_clusterstraceudvtSTDtr rrcluster(s   zVectorSpaceClusterer.clustercCdS)zD Finds the clusters using the given set of vectors. Nr )r r#r%r r rr"Az(VectorSpaceClusterer.cluster_vectorspacecCs<|jr||}|jdurt|j|}||}||SN)rrrrr!classify_vectorspace cluster_name)r rr,r r rrGs     zVectorSpaceClusterer.classifycCr-)zN Returns the index of the appropriate cluster for the vector. Nr r rr r rr0Or.z)VectorSpaceClusterer.classify_vectorspacecCs4|jr||}|jdurt|j|}|||Sr/)rrrrr!likelihood_vectorspace)r rlabelr r r likelihoodUs    zVectorSpaceClusterer.likelihoodcCs||}||kr dSdS)zP Returns the likelihood of the vector belonging to the cluster. g?g)r0)r rr, predictedr r rr3\s z+VectorSpaceClusterer.likelihood_vectorspacecCs,|jr||}|jdurt|j|}|S)zU Returns the vector after normalisation and dimensionality reduction N)rrrrr!r2r r rrcs   zVectorSpaceClusterer.vectorcCs|tt||S)z7 Normalises the vector to unit length. rrr!r2r r rrmszVectorSpaceClusterer._normalise)FN)FF)__name__ __module__ __qualname____doc__rr,rr"rr0r5r3rrr r r rrs     rcCs||}tt||S)z} Returns the euclidean distance between vectors u and v. This is equivalent to the length of the vector (u - v). r7)r&vdiffr r reuclidean_distancetsr>cCs0dt||tt||tt||S)zw Returns 1 minus the cosine of the angle between vectors v and u. This is equal to ``1 - (u.v / |u||v|)``. )rr!r)r&r<r r rcosine_distance}s0r@c@s2eZdZdZddZd ddZddZd d Zd S) _DendrogramNodezTree node of a dendrogram.cGs||_||_dSr/)_value _children)r valuechildrenr r rrs z_DendrogramNode.__init__TcCs<|jrg}|jD] }|||q|S|r|jgS|gSr/)rCextendleavesrB)r valuesrGchildr r rrGs z_DendrogramNode.leavescCs|j|fg}t||kr@|\}}|js|||fn#|jD]}|jr.||j|fq |d|fq |t||ks g}|D] \}}||qD|SNr)rBrpoprCpushappendsortrG)r nqueueprioritynoderIgroupsr r rrSs      z_DendrogramNode.groupscCst|j|jdkSrJ)r@rB)r comparatorr r r__lt__sz_DendrogramNode.__lt__N)T)r8r9r:r;rrGrSrUr r r rrAs   rAc@s@eZdZdZgfddZddZddZgfdd Zd d Zd 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. cCs(dd|D|_t|j|_d|_dS)zs :param items: the items at the leaves of the dendrogram :type items: sequence of (any) cSsg|]}t|qSr )rAritemr r rrz'Dendrogram.__init__..r?N)_itemscopy_original_items_merge)r itemsr r rrs zDendrogram.__init__csjt|dksJtjgfdd|DR}jd7_|j|d<|ddD]}j|=q,dS)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 c3s|]}j|VqdSr/)rZ)rirr r z#Dendrogram.merge..r?rN)rrAr]rZ)r indicesrRr`r rrmerges  zDendrogram.mergecCs8t|jdkrt|jg|jR}n|jd}||S)z Finds the n-groups of items (leaves) reachable from a cut at depth n. :param n: number of groups :type n: int r?r)rrZrAr]rS)r rOrootr r rrSs  zDendrogram.groupscsd\}}}t|jdkrt|jg|jR}n|jd}|j}|r$|}ndd|D}ttt|ddtddfdd d d }|j|fg} fd d|D} | r| \} } t td d| j } t t|j | }| rt |}t|}tt|D]L}||| vr||kr||d|n||kr|||dn|||||| |<q||kr|krnn ||||q|| |q|d| j D] }|j r| |j|fq| | D]}||q|d| s]|dfdd|D|ddS)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 )+-|r?rcSsg|]}d|jqS)z%s)rBrleafr r rrrz#Dendrogram.show..r_ cs|||Sr/r )centreleftright)lhalfrhalfr rformatszDendrogram.show..formatcSst|dSr/)rwrite)strr r rdisplaysz Dendrogram.show..displaycsg|]}dqS)rkr ri)rqr rrrYcSs|ddS)NFr)rG)cr r rsz!Dendrogram.show.. c3s|]}|VqdSr/)centerrW)widthr rra#rbz"Dendrogram.show..N)rkrk)rrZrAr]r\maxrintrBrKrrCindexminrangerMrNjoin)r leaf_labelsJOINHLINKVLINKrerGlast_rowrtrP verticalsrQrRchild_left_leafrcmin_idxmax_idxr`rIverticalr )rqrorprzrshowsZ        zDendrogram.showcCsDt|jdkrt|jg|jR}n|jd}|d}dt|S)Nr?rFz)rrZrAr]rG)r rerGr r r__repr__&s    zDendrogram.__repr__N) r8r9r:r;rrdrSrrr r r rrVs   IrV)r[abcrmathrsysrr ImportErrornltk.cluster.apirrr>r@rArVr r r rs      _ +