+ h{Rt^RIt^RIt^RIHt^RIHt^RIHt^RI H t ^RI H t !RR4t RR lt!R R ]4tR tRR ltRtRtRtRtRtRt]R8Xd ]!4R#R#)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)Treeca]tRt^toRtRRltRtRtRtRt Rt R t R t R t R tR t]RRl4tRtRtRtR RltR!RltRtRtR"RltRtRtRtRtRtRtRt Vt!R#)#DependencyGraphzI A container for the nodes and labelled edges of a dependency structure. Nc \R4VnVP^,PRRRRR^/4RVnV'dVP VVVVVR7R#R#)aTDependency 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`. cDRRRRRRRRRRRRRRR\\4R R/ #) addressNwordlemmactagtagfeatsheaddepsrel)rlist*DependencyGraph.__init__..=s94t D)t rrTOPrr N)cell_extractor zero_basedcell_separatortop_relation_label)rnodesupdateroot_parse)selftree_strrrrrs&&&&&&r__init__DependencyGraph.__init__$si0!     1 feUE9aHI  KK-%-#5   rc VPVR#)z_ Removes the node with the given address. References to this node in others will still exist. Nr)r#r s&&rremove_by_address!DependencyGraph.remove_by_addressWs JJw rc VPP4FCp.pVR,F-pWQ9dVPV4KVPV4K/ WCR&KE R#)zX Redirects arcs to any of the nodes in the originals list to the redirect node address. rN)rvaluesappend)r# originalsredirectnodenew_depsdeps&&& r redirect_arcsDependencyGraph.redirect_arcs^sW JJ%%'DHF||#OOH-OOC( $ $L(rc VPV,R,pVPV,R,PV.4VPV,R,V,PV4R#)z_ Adds an arc from the node specified by head_address to the node specified by the mod address. rrN)r setdefaultr-)r# head_address mod_addressrelations&&& radd_arcDependencyGraph.add_arclsV ::k*51 < (33HbA < (299+Frc hVPP4FpVPP4FrpVR,VR,8wgKVR,R8wgK*VR,pVR,PV.4VR,V,PVR,4Kt K R#)zZ Fully connects all non-root nodes. All nodes are set to be dependents of the root node. r rrrN)rr,r6r-)r#node1node2r9s& r connect_graphDependencyGraph.connect_graphvs ZZ&&(E**,#uY'77E%LE>> 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] cVR,#)r r)vs&rr(DependencyGraph.to_dot..sa lr)keyz {} [label="{} ({})"]r r rz {} -> {} [label="{}"]z {} -> {} z })sortedrr,formatitems)r#sr0rrr2s& rto_dotDependencyGraph.to_dots0  ## ''4::,,.4JKD )00YYV  A "&\//1 C6==d9osXX]11$y/3GG  2 L U rc 8VP4p\V4#)a@Show 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] '' )rRdot2img)r# dot_strings& r _repr_svg_DependencyGraph._repr_svg_s[[] z""rc,\VP4#N)rrr#s&r__str__DependencyGraph.__str__stzz""rc4R\VP4 R2#)z)lenrr[s&r__repr__DependencyGraph.__repr__s'DJJ'8@@rc  \V4;_uu_4pVP4PR4Uu.uFp\VVVVR7NK upuuRRR4#uupi +'giR#;i)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  )rrrN)openreadsplitr)filenamerrrinfiler$s&&&& rloadDependencyGraph.loadsh (^^v!' 3 3F ;!0DependencyGraph.left_children..4he)11h r from_iterablerr,sumr# node_indexchildrenrrs&& @r left_childrenDependencyGraph.left_childrenP &&tzz*'=f'E'L'L'NO :&y14h444rc a\P!VPV,R,P44pVPV,R,o\ V3RlV44#)zU Returns the number of right children under the node specified by the given address. rr c38<"TFqS8gK ^xK R#5irmrros& rrs1DependencyGraph.right_children..rurvrwrzs&& @rright_childrenDependencyGraph.right_childrenrrcVPVR,4'g,VPVR,,PV4R#R#)r N)rGrr )r#r0s&&radd_nodeDependencyGraph.add_nodes7$$T)_55 JJtI ' . .t 46rc jRpRpRpRp ^V^V^V^ V /p \V\4'dRVPR44pRV4p RV 4p R p \V ^R 7FwrVPV4pV f \ V4p MV \ V48XgQhVf W,pV!W4wp pppppppVR 8XdK`\V4pV'd V^, pVPV ,PR V RVRVRVRVRVRVRV/4V ^8Xd V^8XdTpVPV,R,V,PV 4K VP^,R,V,'dIVP^,R,V,^,pVPV,Vn WPnR #\P !R4R # \ d!p\ R PT 44ThR p?ii;i \\ 3dT!T4wpppppppELti;i)a}Parse a sentence. :param extractor: a function that given a tuple of cells returns a 7-tuple, where the values are ``word, lemma, ctag, tag, feats, head, rel``. :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`. cVwr#pWW#VRVR3#r)cellsrrr rrs&& rextract_3_cells/DependencyGraph._parse..extract_3_cellss#ODt3D"< .extract_4_cellss#( Dt3D= =rcXVwr#rErgp\V4pWWEVRWx3# \dLi;irint ValueError) rrr line_indexr r r_rrs && rextract_7_cells/DependencyGraph._parse..extract_7_cells sE9> 6Je!3 JCT> >  s  ))c ZVw r#rErgrp \V4pWWEWgW3# \dLi;irZr) rrrrr r rrrrrrs && rextract_10_cells0DependencyGraph._parse..extract_10_cells)sGIN FJe3t!Q JSB B  s  **c3$"TFqxK R#5irZr)rplines& rrs)DependencyGraph._parse..:s:'9td'9s c3@"TFqP4xK R#5irZ)rstriprpls& rrsr<s,VVsc38"TFq'gK VxK R#5irZrrs& rrsr=s'EqQEs  N)startTNumber of tab-delimited fields ({}) not supported by CoNLL(10) or Malt-Tab(4) formatrr r r rrrrrrzBThe graph doesn't contain a node that depends on the root element.) isinstancestrrf enumerater_KeyErrorrrO TypeErrorrrr r-r!rwarningswarn)r#input_rrrrrrrr extractorslines cell_numberrrrrer r rrrrr root_addresss&&&&&& rr"DependencyGraph._parsesK, = > ? C       fc " ":v||D'9:F,V,'E' $U!4KEJJ~.E"!%j "c%j000%%/%>> 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 F)rr,tupleget_cycle_pathrD) r# distancesr0r2rMr new_entriespair1pair2pairpaths & rcontains_cycleDependencyGraph.contains_cycles4 JJ%%'DF||T)_c23!" $( AK"&EQx58+#U1XuQx$89+4+;i>N+N ('# $"-"3 7d1g%..t/B/B47/KTRSWUDK $rcVR,FpW28XgK VR,.u# VR,FQpVPVPV4V4p\V4^8gK6VP^VR,4Vu# .#)rr )rrDr_insert)r# curr_nodegoal_node_indexr2rs&&& rrDependencyGraph.get_cycle_pathsV$$C%!),--%V$$C&&t':':3'?QD4y1} Ay34 %  rc aV^8XdRoM.V^8XdRoM$V^ 8XdRoM\RPV44hRPV3Rl\VPP 4444#)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 z{word} {tag} {head} z{word} {tag} {head} {rel} z9{i} {word} {lemma} {ctag} {tag} {feats} {head} {rel} _ _ rrc3p<"TF+wrVR,R8wgKSP!RRV/VBxK- R#5i)rrrNr)rO)rprr0templates& rrs+DependencyGraph.to_conll.. s9 5E{e# )HOO (a (4 (5s66)rrOjoinrNrrP)r#stylers&&@rto_conllDependencyGraph.to_conlls{ A:0H aZ7H b[U 228&-  ww !$**"2"2"45   rc ^RIp\\^\VP444pVUu.uF=q0P V4'gKW0P V4VP V43NK? pp/VnVF*pVPV,R,VPV&K, VP4pVPV4VPV4V#uupi)zJConvert the data in a ``nodelist`` into a networkx labeled directed graph.Nr ) networkxrranger_rrr nx_labels MultiDiGraphadd_nodes_fromadd_edges_from)r#r nx_nodelistn nx_edgelistgs& rnx_graphDependencyGraph.nx_graphs5C O45 4? 4?q88A; *Q TYYq\ *K  A $ 1 f 5DNN1   ! ! # % % s C!&C!)rrr!r)NNFNROOT)FNr)NFNr)TrZ)"__name__ __module__ __qualname____firstlineno____doc__r%r)r3r:r?rDrGrRrWr\r` staticmethodrir}rrr"rrrrrrrrrr__static_attributes____classdictcell__) __classdict__s@rrrs1f  $G E(*+Z# #A4555xt  = . 0d  :rrc^\R4VR 9d%\P!RRV,.RVRR7pM,\P!RRV,.\VRR7R7pVP# \ RP T44h;i \dp\ R 4ThR p?ii;i) 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). dotz-T%sT)capture_outputinputtextutf8)encoding)rzACannot create image representation by running dot from string: {}z0Cannot find the dot binary from Graphviz packageN)rdot_jsonjsonsvg)r subprocessrunbytesstdout ExceptionrOOSError)rVtprocrs&& rrUrU&sSE 66!~~FQJ'#'$ "~~FQJ' V<;;  6*%  SJKQRRSs) BA"A11B  B B, B''B,c]tRtRtRtRtR#)DependencyGraphErroriKzDependency graph exception.rN)rrrrrrrrrrrKs%rrcV\4\4\4\4R#rZ) malt_demo conll_democonll_file_democycle_finding_demorrrdemorOs KLrc\R4pVP4pVP4V'd^RIp^RIHpVP 4pVP4VPV^R7pVPWV^2R7VPWVVP4VP.4VP.4VPR4VP4R#R#)zk 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 N)pylab)dim) node_sizeztree.png)rrpprintr matplotlibrrinfo spring_layoutdraw_networkx_nodesdraw_networkx_labelsrxticksytickssavefigshow)nxdgrrrrposs& rrrVs   B* 779DKKM $ KKM $$QA$.$$Qr$:%%abll; R R j!  rc\\4pVP4pVP4\ V4\ VP ^44R#)z[ A demonstration of how to read a string representation of a CoNLL format dependency tree. N)r conll_data1rrprintr)r)rs rrrs9  %B 779DKKM "I "++a.rc\R4\PR4Uu.uFq'gK \V4NK ppVF.pVP 4p\R4VP 4K0 R#uupi)zMass conll_read demo...rcrN)r- conll_data2rfrrr)entrygraphsgraphrs rrrsa #$2=2C2CF2K U2Ku$oe$2KF Uzz| d  Vs A8A8c \\4p\VP44\4pVP RRR^.RRR^/4VP RRR^.RRR^/4VP RRR^.RRR^/4VP RRR^.RRR^/4VP RRR^.RRR^/4\VP44R#)r Nrrrr NTOP)r treebank_datar-rr)r) cyclic_dgs rrrs  'B "   !I fqc5%ANO fqc5&)QOP fqc5&)QOP fqc5&)QOP fqc5&)QOP ) " " $%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)rr r collectionsr itertoolsrrrnltk.internalsr nltk.treerrrUr rrrrrrr5r,r/rrrrr<s #&DDN"SJ&9&*Z  & ( T l zFr