o rZh{@sdZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z Gdd d Z dd d ZGd ddeZddZdddZddZddZddZdZdZdZedkr`edSdS) z Tools for reading and writing dependency trees. The input is assumed to be in Malt-TAB format (https://stp.lingfil.uu.se/~nivre/research/MaltXML.html). N) defaultdict)chain)pformat) find_binary)Treec@seZdZdZ     d:ddZddZd d Zd d Zd dZddZ ddZ ddZ ddZ ddZ ddZe d;ddZddZdd Zd!d"Z    dd,d-Zd.d/Zd0d1Zd2d3Zd4d5Zd6d7Zd8d9ZdS)?DependencyGraphzQ A container for the nodes and labelled edges of a dependency structure. NFROOTcCsLtdd|_|jdddddd|_|r$|j|||||ddSdS)aDependency graph. We place a dummy `TOP` node with the index 0, since the root node is often assigned 0 as its head. This also means that the indexing of the nodes corresponds directly to the Malt-TAB format, which starts at 1. If zero-based is True, then Malt-TAB-like input with node numbers starting at 0 and the root node assigned -1 (as produced by, e.g., zpar). :param str cell_separator: the cell separator. If not provided, cells are split by whitespace. :param str top_relation_label: the label by which the top relation is identified, for examlple, `ROOT`, `null` or `TOP`. c Ssdddddddttdd S)N) addresswordlemmactagtagfeatsheaddepsrel)rlistrrI/var/www/auris/lib/python3.10/site-packages/nltk/parse/dependencygraph.py=sz*DependencyGraph.__init__..rTOP)r r r N)cell_extractor zero_basedcell_separatortop_relation_label)rnodesupdateroot_parse)selftree_strrrrrrrr__init__$s zDependencyGraph.__init__cCs |j|=dS)zw Removes the node with the given address. References to this node in others will still exist. Nr)rr rrrremove_by_addressWs z!DependencyGraph.remove_by_addresscCsL|jD]}g}|dD]}||vr||q ||q ||d<qdS)zp Redirects arcs to any of the nodes in the originals list to the redirect node address. rN)rvaluesappend)rZ originalsredirectnodeZnew_depsdeprrr redirect_arcs^s    zDependencyGraph.redirect_arcscCs@|j|d}|j|d|g|j|d||dS)zw Adds an arc from the node specified by head_address to the node specified by the mod address. rrN)r setdefaultr%)rZ head_addressZ mod_addressrelationrrradd_arclszDependencyGraph.add_arccCsn|jD]/}|jD]'}|d|dkr3|ddkr3|d}|d|g|d||dq qdS)zr Fully connects all non-root nodes. All nodes are set to be dependents of the root node. r rrrN)rr$r*r%)rZnode1Znode2r+rrr connect_graphvszDependencyGraph.connect_graphcCs |j|S)z'Return the node with the given address.r"rZ node_addressrrrget_by_addresss zDependencyGraph.get_by_addresscCs ||jvS)zq Returns true if the graph contains a node with the given node address, false otherwise. r"r.rrrcontains_addresss z DependencyGraph.contains_addressc Csd}|d7}|d7}t|jdddD];}|d|d|d|d 7}|d D]#\}}|D]}|d urD|d |d||7}q2|d |d|7}q2q,q|d7}|S)aReturn a dot representation suitable for using with Graphviz. >>> dg = DependencyGraph( ... 'John N 2\n' ... 'loves V 0\n' ... 'Mary N 2' ... ) >>> print(dg.to_dot()) digraph G{ edge [dir=forward] node [shape=plaintext] 0 [label="0 (None)"] 0 -> 2 [label="ROOT"] 1 [label="1 (John)"] 2 [label="2 (loves)"] 2 -> 1 [label=""] 2 -> 3 [label=""] 3 [label="3 (Mary)"] } z digraph G{ zedge [dir=forward] znode [shape=plaintext] cSs|dSNr r)vrrrrsz(DependencyGraph.to_dot..)keyz {} [label="{} ({})"]r r rNz {} -> {} [label="{}"]z {} -> {} z })sortedrr$formatitems)rsr'rrr(rrrto_dots$zDependencyGraph.to_dotcCs|}t|S)aShow SVG representation of the transducer (IPython magic). >>> from nltk.test.setup_fixt import check_binary >>> check_binary('dot') >>> dg = DependencyGraph( ... 'John N 2\n' ... 'loves V 0\n' ... 'Mary N 2' ... ) >>> dg._repr_svg_().split('\n')[0] '' )r8dot2img)r dot_stringrrr _repr_svg_s zDependencyGraph._repr_svg_cCs t|jSN)rrrrrr__str__s zDependencyGraph.__str__cCsdt|jdS)Nz)lenrr=rrr__repr__szDependencyGraph.__repr__csLt|}fdd|dDWdS1swYdS)a :param filename: a name of a file in Malt-TAB format :param zero_based: nodes in the input file are numbered starting from 0 rather than 1 (as produced by, e.g., zpar) :param str cell_separator: the cell separator. If not provided, cells are split by whitespace. :param str top_relation_label: the label by which the top relation is identified, for examlple, `ROOT`, `null` or `TOP`. :return: a list of DependencyGraphs csg|] }t|dqS))rrrr).0r rrrrr sz(DependencyGraph.load.. N)openreadsplit)filenamerrrinfilerrCrloads  $zDependencyGraph.loadc<t|j|d}|j|dtfdd|DS)zl Returns the number of left children under the node specified by the given address. rr c3s|] }|krdVqdSNrrBcindexrr z0DependencyGraph.left_children..r from_iterablerr$sumrZ node_indexchildrenrrQr left_childrenzDependencyGraph.left_childrencrL)zm Returns the number of right children under the node specified by the given address. rr c3s|] }|krdVqdSrMrrOrQrrrSrTz1DependencyGraph.right_children..rUrXrrQrright_childrenr[zDependencyGraph.right_childrencCs*||ds|j|d|dSdSr1)r0rr)rr'rrradd_nodeszDependencyGraph.add_nodec Csdd}dd}dd}dd} |||| d } t|tr&d d |d D}d d |D} dd | D} d} t| ddD]\} }||}| durNt|} n| t|ksVJ|duruz| | }Wntyt}ztd| |d}~wwz||| \} }}}}}}}Wnttfy||\}}}}}}}Ynw|dkrq.extract_3_cellscSs |\}}}}|||||d||fSr^r)r`rRr r rrrrrextract_4_cellss z/DependencyGraph._parse..extract_4_cellsc SsF|\}}}}}}}zt|}Wn tyYnw|||||d||fSr^int ValueError) r`rR line_indexr r r _rrrrrextract_7_cells s  z/DependencyGraph._parse..extract_7_cellsc SsL|\ }}}}}}}} } } zt|}Wn tyYnw|||||||| fSr<rc) r`rRrfr r r r rrrrgrrrextract_10_cells)s  z0DependencyGraph._parse..extract_10_cells) css|]}|VqdSr<r)rBlinerrrrS:sz)DependencyGraph._parse.. css|]}|VqdSr<)rstriprBlrrrrS<css|]}|r|VqdSr<rrqrrrrS=rsNrN)startTNumber of tab-delimited fields ({}) not supported by CoNLL(10) or Malt-Tab(4) formatrg)r r r r r rrrrjrrzBThe graph doesn't contain a node that depends on the root element.) isinstancestrrH enumerater?KeyErrorrer5 TypeErrorrdrrr%rrwarningswarn)rZinput_rrrrrarbrhriZ extractorslinesZ cell_numberrRrnr`er r r r rrrZ root_addressrrrrs         zDependencyGraph._parseTcCs|d}|r |dkr |S|S)Nr ,r)rr'filterwrrr_word|s zDependencyGraph._wordcsH|}|d}tt|d}|r"t|fdd|DS|S)zTurn dependency graphs into NLTK trees. :param int i: index of a node :return: either a word (if the indexed node is a leaf) or a ``Tree``. r rcg|]}|qSr_treerBr(r=rrrDz)DependencyGraph._tree..)r/r4rrVr$r)rir'r rrr=rrs zDependencyGraph._treecs<j}|d}tt|d}t|fdd|DS)z Starting with the ``root`` node, build a dependency tree using the NLTK ``Tree`` constructor. Dependency labels are omitted. r rcrrrrr=rrrDrz(DependencyGraph.tree..)rr4rrVr$r)rr'r rrr=rtreeszDependencyGraph.treeccst|s|j}|d|df}tt|dD]}||}||d|d|dffV|j|dEdHqdS)zs Extract dependency triples of the form: ((head word, head tag), rel, (dep word, dep tag)) r r rr)r'N)rr4rrVr$r/triples)rr'rrr(rrrrs zDependencyGraph.triplescC&z|j|dWStyYdSw)Nrr IndexErrorrrrrr_hd  zDependencyGraph._hdcCr)Nrrrrrr_relrzDependencyGraph._relc Csi}|jD]}|dD]}t|d|g}d||<q q|jD]P}i}|D]#}|D]}|d|dkrHt|d|dg}||||||<q*q&|D]#} || || <| d| dkro||| d| d} | SqLq dS)aECheck whether there are cycles. >>> dg = DependencyGraph(treebank_data) >>> dg.contains_cycle() False >>> cyclic_dg = DependencyGraph() >>> top = {'word': None, 'deps': [1], 'rel': 'TOP', 'address': 0} >>> child1 = {'word': None, 'deps': [2], 'rel': 'NTOP', 'address': 1} >>> child2 = {'word': None, 'deps': [4], 'rel': 'NTOP', 'address': 2} >>> child3 = {'word': None, 'deps': [1], 'rel': 'NTOP', 'address': 3} >>> child4 = {'word': None, 'deps': [3], 'rel': 'NTOP', 'address': 4} >>> cyclic_dg.nodes = { ... 0: top, ... 1: child1, ... 2: child2, ... 3: child3, ... 4: child4, ... } >>> cyclic_dg.root = top >>> cyclic_dg.contains_cycle() [1, 2, 4, 3] rr rNrF)rr$tupleget_cycle_pathr/) rZ distancesr'r(r3rgZ new_entriesZpair1Zpair2pairpathrrrcontains_cycles.     zDependencyGraph.contains_cyclecCsl|dD] }||kr|dgSq|dD]}||||}t|dkr3|d|d|SqgS)Nrr r)rr/r?insert)rZ curr_nodeZgoal_node_indexr(rrrrrs   zDependencyGraph.get_cycle_pathcsZ|dkrdn|dkrdn|dkrdntd|dfd d t|jDS) z The dependency graph in CoNLL format. :param style: the style to use for the format (3, 4, 10 columns) :type style: int :rtype: str rjz{word} {tag} {head} rkz{word} {tag} {head} {rel} rmz9{i} {word} {lemma} {ctag} {tag} {feats} {head} {rel} _ _ rur_c3s4|]\}}|ddkrjdd|i|VqdS)r rrNr)r5)rBrr'templaterrrS s z+DependencyGraph.to_conll..)rer5joinr4rr6)rstylerrrto_conlls  zDependencyGraph.to_conllcsrddl}ttdtj}fdd|D}i_|D] }j|dj|<q|}|||||S)zJConvert the data in a ``nodelist`` into a networkx labeled directed graph.rNrNcs,g|]}|r|||fqSr)rr)rBnr=rrrDs  z,DependencyGraph.nx_graph..r ) networkxrranger?r nx_labelsZ MultiDiGraphZadd_nodes_fromZadd_edges_from)rrZ nx_nodelistZ nx_edgelistrgrr=rnx_graphs   zDependencyGraph.nx_graph)NNFNr)FNr)NFNr)Tr<)__name__ __module__ __qualname____doc__r!r#r)r,r-r/r0r8r;r>r@ staticmethodrKrZr\r]rrrrrrrrrrrrrrrrsN 3  -    z 2 rsvgc Csz5tdz&|dvrtjdd|gd|dd}ntjdd|gt|ddd}|jWWStd |tyF}ztd |d }~ww) a Create image representation fom dot_string, using the 'dot' program from the Graphviz package. Use the 't' argument to specify the image file format, for ex. 'jpeg', 'eps', 'json', 'png' or 'webp' (Running 'dot -T:' lists all available formats). Note that the "capture_output" option of subprocess.run() is only available with text formats (like svg), but not with binary image formats (like png). dot)rZdot_jsonjsonrz-T%sT)capture_outputinputtextutf8)encoding)rzACannot create image representation by running dot from string: {}z0Cannot find the dot binary from Graphviz packageN)r subprocessrunbytesstdout Exceptionr5OSError)r:tprocr~rrrr9&s0      r9c@seZdZdZdS)DependencyGraphErrorzDependency graph exception.N)rrrrrrrrrKsrcCsttttdSr<) malt_demo conll_democonll_file_democycle_finding_demorrrrdemoOs rFcCstd}|}||rLddl}ddlm}|}||j|dd}|j ||dd| |||j | g| g|d |dSdS) zw A demonstration of the result of reading a dependency version of the first sentence of the Penn Treebank. Pierre NNP 2 NMOD Vinken NNP 8 SUB , , 2 P 61 CD 5 NMOD years NNS 6 AMOD old JJ 2 NMOD , , 2 P will MD 0 ROOT join VB 8 VC the DT 11 NMOD board NN 9 OBJ as IN 9 VMOD a DT 15 NMOD nonexecutive JJ 15 NMOD director NN 12 PMOD Nov. NNP 9 VMOD 29 CD 16 NMOD . . 9 VMOD rN)pylabrN)dim2)Z node_sizeztree.png)rrpprintrZ matplotlibrrinfoZ spring_layoutZdraw_networkx_nodesZdraw_networkx_labelsrZxticksZyticksZsavefigshow)nxdgrrrrposrrrrVs$     rcCs2tt}|}|t|t|ddS)zg A demonstration of how to read a string representation of a CoNLL format dependency tree. rkN)r conll_data1rrprintr)rrrrrrs rcCsBtdddtdD}|D]}|}td|qdS)NzMass conll_read demo...cSsg|]}|rt|qSrrA)rBentryrrrrDsz#conll_file_demo..rEro)r conll_data2rHrr)Zgraphsgraphrrrrrs rcCstt}t|t}|ddgddd|ddgddd|ddgddd|ddgddd|ddgdddt|dS) NrNrr)r rrr ZNTOPrkrj)r treebank_datarrr])rZ cyclic_dgrrrrs rra/ 1 Ze ze Pron Pron per|3|evofmv|nom 2 su _ _ 2 had heb V V trans|ovt|1of2of3|ev 0 ROOT _ _ 3 met met Prep Prep voor 8 mod _ _ 4 haar haar Pron Pron bez|3|ev|neut|attr 5 det _ _ 5 moeder moeder N N soort|ev|neut 3 obj1 _ _ 6 kunnen kan V V hulp|ott|1of2of3|mv 2 vc _ _ 7 gaan ga V V hulp|inf 6 vc _ _ 8 winkelen winkel V V intrans|inf 11 cnj _ _ 9 , , Punc Punc komma 8 punct _ _ 10 zwemmen zwem V V intrans|inf 11 cnj _ _ 11 of of Conj Conj neven 7 vc _ _ 12 terrassen terras N N soort|mv|neut 11 cnj _ _ 13 . . Punc Punc punt 12 punct _ _ a1 Cathy Cathy N N eigen|ev|neut 2 su _ _ 2 zag zie V V trans|ovt|1of2of3|ev 0 ROOT _ _ 3 hen hen Pron Pron per|3|mv|datofacc 2 obj1 _ _ 4 wild wild Adj Adj attr|stell|onverv 5 mod _ _ 5 zwaaien zwaai N N soort|mv|neut 2 vc _ _ 6 . . Punc Punc punt 5 punct _ _ 1 Ze ze Pron Pron per|3|evofmv|nom 2 su _ _ 2 had heb V V trans|ovt|1of2of3|ev 0 ROOT _ _ 3 met met Prep Prep voor 8 mod _ _ 4 haar haar Pron Pron bez|3|ev|neut|attr 5 det _ _ 5 moeder moeder N N soort|ev|neut 3 obj1 _ _ 6 kunnen kan V V hulp|ott|1of2of3|mv 2 vc _ _ 7 gaan ga V V hulp|inf 6 vc _ _ 8 winkelen winkel V V intrans|inf 11 cnj _ _ 9 , , Punc Punc komma 8 punct _ _ 10 zwemmen zwem V V intrans|inf 11 cnj _ _ 11 of of Conj Conj neven 7 vc _ _ 12 terrassen terras N N soort|mv|neut 11 cnj _ _ 13 . . Punc Punc punt 12 punct _ _ 1 Dat dat Pron Pron aanw|neut|attr 2 det _ _ 2 werkwoord werkwoord N N soort|ev|neut 6 obj1 _ _ 3 had heb V V hulp|ovt|1of2of3|ev 0 ROOT _ _ 4 ze ze Pron Pron per|3|evofmv|nom 6 su _ _ 5 zelf zelf Pron Pron aanw|neut|attr|wzelf 3 predm _ _ 6 uitgevonden vind V V trans|verldw|onverv 3 vc _ _ 7 . . Punc Punc punt 6 punct _ _ 1 Het het Pron Pron onbep|neut|zelfst 2 su _ _ 2 hoorde hoor V V trans|ovt|1of2of3|ev 0 ROOT _ _ 3 bij bij Prep Prep voor 2 ld _ _ 4 de de Art Art bep|zijdofmv|neut 6 det _ _ 5 warme warm Adj Adj attr|stell|vervneut 6 mod _ _ 6 zomerdag zomerdag N N soort|ev|neut 3 obj1 _ _ 7 die die Pron Pron betr|neut|zelfst 6 mod _ _ 8 ze ze Pron Pron per|3|evofmv|nom 12 su _ _ 9 ginds ginds Adv Adv gew|aanw 12 mod _ _ 10 achter achter Adv Adv gew|geenfunc|stell|onverv 12 svp _ _ 11 had heb V V hulp|ovt|1of2of3|ev 7 body _ _ 12 gelaten laat V V trans|verldw|onverv 11 vc _ _ 13 . . Punc Punc punt 12 punct _ _ 1 Ze ze Pron Pron per|3|evofmv|nom 2 su _ _ 2 hadden heb V V trans|ovt|1of2of3|mv 0 ROOT _ _ 3 languit languit Adv Adv gew|geenfunc|stell|onverv 11 mod _ _ 4 naast naast Prep Prep voor 11 mod _ _ 5 elkaar elkaar Pron Pron rec|neut 4 obj1 _ _ 6 op op Prep Prep voor 11 ld _ _ 7 de de Art Art bep|zijdofmv|neut 8 det _ _ 8 strandstoelen strandstoel N N soort|mv|neut 6 obj1 _ _ 9 kunnen kan V V hulp|inf 2 vc _ _ 10 gaan ga V V hulp|inf 9 vc _ _ 11 liggen lig V V intrans|inf 10 vc _ _ 12 . . Punc Punc punt 11 punct _ _ 1 Zij zij Pron Pron per|3|evofmv|nom 2 su _ _ 2 zou zal V V hulp|ovt|1of2of3|ev 7 cnj _ _ 3 mams mams N N soort|ev|neut 4 det _ _ 4 rug rug N N soort|ev|neut 5 obj1 _ _ 5 ingewreven wrijf V V trans|verldw|onverv 6 vc _ _ 6 hebben heb V V hulp|inf 2 vc _ _ 7 en en Conj Conj neven 0 ROOT _ _ 8 mam mam V V trans|ovt|1of2of3|ev 7 cnj _ _ 9 de de Art Art bep|zijdofmv|neut 10 det _ _ 10 hare hare Pron Pron bez|3|ev|neut|attr 8 obj1 _ _ 11 . . Punc Punc punt 10 punct _ _ 1 Of of Conj Conj onder|metfin 0 ROOT _ _ 2 ze ze Pron Pron per|3|evofmv|nom 3 su _ _ 3 had heb V V hulp|ovt|1of2of3|ev 0 ROOT _ _ 4 gewoon gewoon Adj Adj adv|stell|onverv 10 mod _ _ 5 met met Prep Prep voor 10 mod _ _ 6 haar haar Pron Pron bez|3|ev|neut|attr 7 det _ _ 7 vriendinnen vriendin N N soort|mv|neut 5 obj1 _ _ 8 rond rond Adv Adv deelv 10 svp _ _ 9 kunnen kan V V hulp|inf 3 vc _ _ 10 slenteren slenter V V intrans|inf 9 vc _ _ 11 in in Prep Prep voor 10 mod _ _ 12 de de Art Art bep|zijdofmv|neut 13 det _ _ 13 buurt buurt N N soort|ev|neut 11 obj1 _ _ 14 van van Prep Prep voor 13 mod _ _ 15 Trafalgar_Square Trafalgar_Square MWU N_N eigen|ev|neut_eigen|ev|neut 14 obj1 _ _ 16 . . Punc Punc punt 15 punct _ _ __main__)r)F)rrr{ collectionsr itertoolsrrrZnltk.internalsrZ nltk.treerrr9rrrrrrrrrrrrrrrs4       % -   V