ó ù`]c@s"dZddlmZmZddlmZddlmZddlm Z ddl Z ddl Z ddl m Z ddlmZdd lmZed efd „ƒYƒZd efd „ƒYZd„Zed„Zd„Zd„Zd„ZdZdZdZedkreƒndS(u˜ Tools for reading and writing dependency trees. The input is assumed to be in Malt-TAB format (http://stp.lingfil.uu.se/~nivre/research/MaltXML.html). iÿÿÿÿ(tprint_functiontunicode_literals(t defaultdict(tchain(tpformatN(t string_types(tTree(tpython_2_unicode_compatibletDependencyGraphcBs(eZdZddeddd„Zd„Zd„Zd„Zd„Z d„Z d„Z d „Z d „Z d „Zd „Zeeddd „ƒZd„Zd„Zd„Zdeddd„Zed„Zd„Zd„Zdd„Zd„Zd„Zd„Zd„Zd„Zd„Z RS(uQ A container for the nodes and labelled edges of a dependency structure. uROOTc Csvtd„ƒ|_|jdjidd6dd6dd6ƒd |_|rr|j|d|d|d |d |ƒnd S( u¥Dependency 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`. cSsIi dd6dd6dd6dd6dd6dd6dd6ttƒd6dd 6S( Nuaddressuwordulemmauctagutagufeatsuheadudepsurel(tNoneRtlist(((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytCs iuTOPuctagutaguaddresstcell_extractort zero_basedtcell_separatorttop_relation_labelN(RtnodestupdateR troott_parse(tselfttree_strR R RR((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt__init__)s ) cCs|j|=dS(uw Removes the node with the given address. References to this node in others will still exist. N(R(Rtaddress((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytremove_by_address]scCslxe|jjƒD]T}g}x;|dD]/}||krI|j|ƒq'|j|ƒq'W||d>> 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)"] } u digraph G{ uedge [dir=forward] unode [shape=plaintext] tkeycSs|dS(Nuaddress((tv((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyR ±tu %s [label="%s (%s)"]uaddressuwordudepsu %s -> %s [label="%s"]u %s -> %s u }N(tsortedRRtitemsR (RtsRtreltdepsR((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytto_dot”s  %  $ c Cs|jƒ}y:tjddgdtjdtjdtjdtƒ}Wntk retdƒ‚nX|j|ƒ\}}|r™tdj|ƒƒ‚n|S( u7Show SVG representation of the transducer (IPython magic). >>> dg = DependencyGraph( ... 'John N 2\n' ... 'loves V 0\n' ... 'Mary N 2' ... ) >>> dg._repr_svg_().split('\n')[0] '' udotu-Tsvgtstdintstdouttstderrtuniversal_newlinesu0Cannot find the dot binary from Graphviz packageu?Cannot create svg representation by running dot from string: {}( R4t subprocesstPopentPIPEtTruetOSErrort Exceptiont communicatetformat(Rt dot_stringtprocesstoutterr((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt _repr_svg_Ás       cCs t|jƒS(N(RR(R((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt__str__áscCsdjt|jƒƒS(Nu (R@tlenR(R((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt__repr__äscCsWt|ƒE}g|jƒjdƒD]$}t|d|d|d|ƒ^q%SWdQXdS(uï :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 u R RRN(topentreadtsplitR(tfilenameR RRtinfileR((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytloadçscsKtj|j|djƒƒ}|j|d‰t‡fd†|DƒƒS(ul Returns the number of left children under the node specified by the given address. udepsuaddressc3s!|]}|ˆkrdVqdS(iN((t.0tc(tindex(s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys s(Rt from_iterableRRtsum(Rt node_indextchildren((RQs9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt left_childrens csKtj|j|djƒƒ}|j|d‰t‡fd†|DƒƒS(um Returns the number of right children under the node specified by the given address. udepsuaddressc3s!|]}|ˆkrdVqdS(iN((RORP(RQ(s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys s(RRRRRRS(RRTRU((RQs9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytright_children s cCs2|j|dƒs.|j|dj|ƒndS(Nuaddress(R+RR(RR((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytadd_nodesc Cs½d„}d„}d„}d„} i|d6|d6|d6| d6} t|tƒrqd „|jd ƒDƒ}nd „|Dƒ} d „| Dƒ} d} xÈt| d dƒD]´\} }|j|ƒ}| dkràt|ƒ} n| t|ƒksøt‚|dkr>y| | }Wq>tk r:tdj | ƒƒ‚q>Xny+||| ƒ\} }}}}}}}Wn8t tfk r£||ƒ\}}}}}}}nX|dkr¶qªnt |ƒ}|rÕ|d7}n|j | j i| d6|d6|d6|d6|d6|d6|d6|d6ƒ| dkrB|dkrB|}n|j |d|j| ƒqªW|j dd|r¬|j dd|d}|j ||_||_n tjdƒdS(u½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`. cSs+|\}}}|||||d|dfS(Nu((tcellsRQtwordttagthead((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytextract_3_cells.scSs.|\}}}}|||||d||fS(Nu((RYRQRZR[R\R2((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytextract_4_cells2sc Ss[|\}}}}}}}yt|ƒ}Wntk r>nX|||||d||fS(Nu(tintt ValueError( RYRQt line_indexRZtlemmaR[t_R\R2((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytextract_7_cells6s  c Ssd|\ }}}}}}}} } } yt|ƒ}Wntk rGnX|||||||| fS(N(R_R`( RYRQRaRZRbtctagR[tfeatsR\R2Rc((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytextract_10_cells?s $ iiii css|] }|VqdS(N((ROtline((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys Psu css|]}|jƒVqdS(N(trstrip(ROtl((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys Rscss|]}|r|VqdS(N((RORj((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys SststartiuUNumber of tab-delimited fields ({0}) not supported by CoNLL(10) or Malt-Tab(4) formatu_uaddressuwordulemmauctagutagufeatsuheadureliudepsuBThe graph doesn't contain a node that depends on the root element.N(t isinstanceRRKR t enumerateRGtAssertionErrortKeyErrorR`R@t TypeErrorR_RRRRRtwarningstwarn(Rtinput_R R RRR]R^RdRgt extractorstlinest cell_numberRQRhRYRZRbReR[RfR\R2t root_address((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyRsn       (%        cCs'|d}|r#|dkr#|Sn|S(Nuwordu,((RRtfiltertw((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt_word’s   cCso|j|ƒ}|d}ttj|djƒƒƒ}|rgt|g|D]}|j|ƒ^qKƒS|SdS(u¦ Turn 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``. uwordudepsN(R*R/RRRRRt_tree(RtiRRZR3R((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyR{™s  )cCs[|j}|d}ttj|djƒƒƒ}t|g|D]}|j|ƒ^q?ƒS(u– Starting with the ``root`` node, build a dependency tree using the NLTK ``Tree`` constructor. Dependency labels are omitted. uwordudeps(RR/RRRRRR{(RRRZR3R((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyttree¨s  ccs¥|s|j}n|d|df}xxttj|djƒƒƒD]W}|j|ƒ}||d|d|dffVx|jd|ƒD] }|VqŽWqFWdS(us Extract dependency triples of the form: ((head word, head tag), rel, (dep word, dep tag)) uworductagudepsurelRN(RR/RRRRR*ttriples(RRR\R|Rttriple((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyR~³s & cCs,y|j|dSWntk r'dSXdS(Nuhead(Rt IndexErrorR (RR|((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt_hdÃs cCs,y|j|dSWntk r'dSXdS(Nurel(RR€R (RR|((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyt_relÉs c Cs6i}xL|jjƒD];}x2|dD]&}t|d|gƒ}d||>> 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() [3, 1, 2, 4] udepsuaddressii(RRttupletget_cycle_pathR*tFalse( Rt distancesRRR,Rct new_entriestpair1tpair2tpairtpath((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytcontains_cycleÐs$  ! # cCsŠx)|dD]}||kr |dgSq WxW|dD]K}|j|j|ƒ|ƒ}t|ƒdkr7|jd|dƒ|Sq7WgS(Nudepsuaddressi(R„R*RGtinsert(Rt curr_nodetgoal_node_indexRR‹((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyR„s cs€|dkrd‰n?|dkr*d‰n*|dkr?d‰ntdj|ƒƒ‚dj‡fd †t|jjƒƒDƒƒS( u® The dependency graph in CoNLL format. :param style: the style to use for the format (3, 4, 10 columns) :type style: int :rtype: str iu{word} {tag} {head} iu{word} {tag} {head} {rel} i u9{i} {word} {lemma} {ctag} {tag} {feats} {head} {rel} _ _ uUNumber of tab-delimited fields ({0}) not supported by CoNLL(10) or Malt-Tab(4) formatuc3s:|]0\}}|ddkrˆjd||VqdS(utaguTOPR|N(R@(ROR|R(ttemplate(s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pys %s (R`R@tjoinR/RR0(Rtstyle((Rs9lib/python2.7/site-packages/nltk/parse/dependencygraph.pytto_conll s        cCsÉddl}ttdt|jƒƒƒ}g|D]6}|j|ƒr1||j|ƒ|j|ƒf^q1}i|_x&|D]}|j|d|j|R£R¨R…R¤R¥R¦R§R¿R¹R»RŸ(((s9lib/python2.7/site-packages/nltk/parse/dependencygraph.pyts0  ÿÿ  - V