o rZh &@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)selfZ normaliseZsvd_dimensionsr @/var/www/auris/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 numpyZlinalgZsvdZ transposearrayidentityZfloat64dotrcluster_vectorspace) r vectorsZassign_clusterstraceudvtSTZDtr rr cluster(s   zVectorSpaceClusterer.clustercCdS)zD Finds the clusters using the given set of vectors. Nr )r rrr r r rAz(VectorSpaceClusterer.cluster_vectorspacecCs<|jr||}|jdurt|j|}||}||SN)rrrrrclassify_vectorspaceZ cluster_name)r rr$r r r rGs     zVectorSpaceClusterer.classifycCr%)zN Returns the index of the appropriate cluster for the vector. Nr r rr r r r(Or&z)VectorSpaceClusterer.classify_vectorspacecCs4|jr||}|jdurt|j|}|||Sr')rrrrrlikelihood_vectorspace)r rlabelr r r likelihoodUs    zVectorSpaceClusterer.likelihoodcCs||}||kr dSdS)zP Returns the likelihood of the vector belonging to the cluster. g?g)r()r rr$Z predictedr r r r*\s z+VectorSpaceClusterer.likelihood_vectorspacecCs,|jr||}|jdurt|j|}|S)zU Returns the vector after normalisation and dimensionality reduction N)rrrrrr)r r r rcs   zVectorSpaceClusterer.vectorcCs|tt||S)z7 Normalises the vector to unit length. rrrr)r r r rmszVectorSpaceClusterer._normalise)FN)FF)__name__ __module__ __qualname____doc__r r$rrrr(r,r*rrr r r r rs     rcCs||}tt||S)z} Returns the euclidean distance between vectors u and v. This is equivalent to the length of the vector (u - v). r-)rvdiffr r r euclidean_distancetsr4cCs0dt||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|)``. )rrr)rr2r r r cosine_distance}s0r6c@s2eZdZdZddZd ddZddZd d Zd S) _DendrogramNodezTree node of a dendrogram.cGs||_||_dSr')_value _children)r valuechildrenr r r r s z_DendrogramNode.__init__TcCs<|jrg}|jD] }|||q|S|r|jgS|gSr')r9extendleavesr8)r valuesr=childr r r r=s z_DendrogramNode.leavescCs|j|fg}t||kr@|\}}|js|||fn#|jD]}|jr.||j|fq |d|fq |t||ks g}|D] \}}||qD|SNr)r8rpopr9pushappendsortr=)r nqueueprioritynoder?groupsr r r rIs      z_DendrogramNode.groupscCst|j|jdkSr@)r6r8)r Z comparatorr r r __lt__sz_DendrogramNode.__lt__N)T)r.r/r0r1r r=rIrJr r r r r7s   r7c@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 )r7ritemr r r rz'Dendrogram.__init__..r5N)_itemscopy_original_items_merge)r itemsr r r r s 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')rO)rirr r z#Dendrogram.merge..r5rN)rr7rRrO)r indicesrHrUr rr merges  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 r5r)rrOr7rRrI)r rErootr r r rIs  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 )+-|r5rcSsg|]}d|jqS)z%s)r8rleafr r r rrz#Dendrogram.show..rT cs|||Sr'r )Zcentreleftright)lhalfrhalfr r formatszDendrogram.show..formatcSst|dSr')rwrite)strr r r displaysz Dendrogram.show..displaycsg|]}dqS)r`r r^)rer r rrNcSs|ddS)NFr)r=)cr r r sz!Dendrogram.show.. c3s|]}|VqdSr')centerrL)widthr r rV#rWz"Dendrogram.show..N)r`r`)rrOr7rRrQmaxrintr8rArr9indexminrangerCrDjoin)r Z leaf_labelsZJOINZHLINKZVLINKrZr=last_rowrhrFZ verticalsrGrHZchild_left_leafrXmin_idxZmax_idxrUr?verticalr )rercrdrnr showsZ        zDendrogram.showcCsDt|jdkrt|jg|jR}n|jd}|d}dt|S)Nr5rFz)rrOr7rRr=)r rZr=r r r __repr__&s    zDendrogram.__repr__N) r.r/r0r1r rYrIrxryr r r r rKs   IrK)rPabcrmathrsysrr ImportErrorZnltk.cluster.apirrr4r6r7rKr r r r s      _ +