`]c @sdZddlmZmZddlZddlZddlmZmZddl m Z m Z ddl m Z mZddlmZddlmZdd lmZmZdd lmZed efd YZd efdYZe edefdYZdefdYZdefdYZdeefdYZdeefdYZedeefdYZ edeefdYZ!dZ"dZ#dZ$d Z%d!d"d#d$d%d&d'd(d)d*d+g Z&dS(,uh Class for representing hierarchical language structures, such as syntax trees and morphological trees. i(tprint_functiontunicode_literalsN(tABCMetatabstractmethod(t string_typest add_metaclass(t Productiont Nonterminal(tProbabilisticMixIn(t slice_bounds(tpython_2_unicode_compatiblet unicode_repr(traise_unorderable_typestTreecBs3eZdZd9dZdZdZdZdZdZ dZ dZ d Z d Z d Zd Zd ZdZdZdZeeeZdZdZdZdZdZddZd9dZdZdZdZdZ dd9ddd d!Z!e"dd d"d#Z#e$e$d"d$Z%e&d%Z'd&Z(d'Z)e$d(Z*d)Z+d9d*Z,e&d+d9d9d9d9e$d,Z-e&d-Z.d.Z/d9d:d9d/Z0d0Z1d1Z2d2Z3d3Z4d4dd5d+e$d6Z5d7Z6d8Z7RS(;ui A Tree represents a hierarchical grouping of leaves and subtrees. For example, each constituent in a syntax tree is represented by a single Tree. A tree's children are encoded as a list of leaves and subtrees, where a leaf is a basic (non-tree) value; and a subtree is a nested Tree. >>> from nltk.tree import Tree >>> print(Tree(1, [2, Tree(3, [4]), 5])) (1 2 (3 4) 5) >>> vp = Tree('VP', [Tree('V', ['saw']), ... Tree('NP', ['him'])]) >>> s = Tree('S', [Tree('NP', ['I']), vp]) >>> print(s) (S (NP I) (VP (V saw) (NP him))) >>> print(s[1]) (VP (V saw) (NP him)) >>> print(s[1,1]) (NP him) >>> t = Tree.fromstring("(S (NP I) (VP (V saw) (NP him)))") >>> s == t True >>> t[1][1].set_label('X') >>> t[1][1].label() 'X' >>> print(t) (S (NP I) (VP (V saw) (X him))) >>> t[0], t[1,1] = t[1,1], t[0] >>> print(t) (S (X him) (VP (V saw) (NP I))) The length of a tree is the number of children it has. >>> len(t) 2 The set_label() and label() methods allow individual constituents to be labeled. For example, syntax trees use this label to specify phrase tags, such as "NP" and "VP". Several Tree methods use "tree positions" to specify children or descendants of a tree. Tree positions are defined as follows: - The tree position *i* specifies a Tree's *i*\ th child. - The tree position ``()`` specifies the Tree itself. - If *p* is the tree position of descendant *d*, then *p+i* specifies the *i*\ th child of *d*. I.e., every tree position is either a single index *i*, specifying ``tree[i]``; or a sequence *i1, i2, ..., iN*, specifying ``tree[i1][i2]...[iN]``. Construct a new tree. This constructor can be called in one of two ways: - ``Tree(label, children)`` constructs a new tree with the specified label and list of children. - ``Tree.fromstring(s)`` constructs a new tree by parsing the string ``s``. cCsp|dkr(tdt|jnDt|trStdt|jntj||||_dS(Nu)%s: Expected a node value and child list u.%s() argument 2 should be a list, not a string( tNonet TypeErrorttypet__name__t isinstanceRtlistt__init__t_label(tselftnodetchildren((s(lib/python2.7/site-packages/nltk/tree.pyRfs cCs:|j|jko9|jt|f|jt|fkS(N(t __class__RR(Rtother((s(lib/python2.7/site-packages/nltk/tree.pyt__eq__xs$cCsyt|ts%|jj|jjkS|j|jkr_|jt|f|jt|fkS|jj|jjkSdS(N(RR RRRR(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__lt__~s (cCs ||k S(N((RR((s(lib/python2.7/site-packages/nltk/tree.pyttcCs||kp||k S(N((RR((s(lib/python2.7/site-packages/nltk/tree.pyRRcCs||kp||kS(N((RR((s(lib/python2.7/site-packages/nltk/tree.pyRRcCs ||k S(N((RR((s(lib/python2.7/site-packages/nltk/tree.pyRRcCstddS(Nu$Tree does not support multiplication(R(Rtv((s(lib/python2.7/site-packages/nltk/tree.pyt__mul__scCstddS(Nu$Tree does not support multiplication(R(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__rmul__scCstddS(NuTree does not support addition(R(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__add__scCstddS(NuTree does not support addition(R(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__radd__scCst|ttfr%tj||St|ttfrt|dkrP|St|dkrn||dS||d|dSn(tdt|j t|j fdS(Niiu#%s indices must be integers, not %s( RtinttsliceRt __getitem__ttupletlenRRR(Rtindex((s(lib/python2.7/site-packages/nltk/tree.pyR&s cCst|ttfr(tj|||St|ttfrt|dkr^tdqt|dkr|||d>> t = Tree.fromstring('(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))') >>> t.label() 'S' :return: the node label (typically a string) :rtype: any (R(R((s(lib/python2.7/site-packages/nltk/tree.pytlabels cCs ||_dS(uo Set the node label of the tree. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.set_label("T") >>> print(t) (T (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat)))) :param label: the node label (typically a string) :type label: any N(R(RR1((s(lib/python2.7/site-packages/nltk/tree.pyt set_labels cCsMg}x@|D]8}t|tr8|j|jq |j|q W|S(u Return the leaves of the tree. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.leaves() ['the', 'dog', 'chased', 'the', 'cat'] :return: a list containing this tree's leaves. The order reflects the order of the leaves in the tree's hierarchical structure. :rtype: list (RR textendtleavestappend(RR4tchild((s(lib/python2.7/site-packages/nltk/tree.pyR4s  cCst|j|jS(u Return a flat version of the tree, with all non-root non-terminals removed. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> print(t.flatten()) (S the dog chased the cat) :return: a tree consisting of this tree's root connected directly to its leaves, omitting all intervening non-terminal nodes. :rtype: Tree (R R1R4(R((s(lib/python2.7/site-packages/nltk/tree.pytflattens cCsUd}xD|D]<}t|tr:t||j}q t|d}q Wd|S(uG Return the height of the tree. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.height() 5 >>> print(t[0,0]) (D the) >>> t[0,0].height() 2 :return: The height of this tree. The height of a tree containing no children is 1; the height of a tree containing only leaves is 2; and the height of any other tree is one plus the maximum of its children's heights. :rtype: int ii(RR tmaxtheight(Rtmax_child_heightR6((s(lib/python2.7/site-packages/nltk/tree.pyR9s  upreordercsg}|dkr"|jdnxht|D]Z\}t|try|j|}|jfd|Dq/|jfq/W|dkr|jdn|S( u. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.treepositions() # doctest: +ELLIPSIS [(), (0,), (0, 0), (0, 0, 0), (0, 1), (0, 1, 0), (1,), (1, 0), (1, 0, 0), ...] >>> for pos in t.treepositions('leaves'): ... t[pos] = t[pos][::-1].upper() >>> print(t) (S (NP (D EHT) (N GOD)) (VP (V DESAHC) (NP (D EHT) (N TAC)))) :param order: One of: ``preorder``, ``postorder``, ``bothorder``, ``leaves``. upreorderu bothorderc3s|]}f|VqdS(N((t.0tp(ti(s(lib/python2.7/site-packages/nltk/tree.pys Msu postorder(upreorderu bothorder((u postorderu bothorder((R5t enumerateRR t treepositionsR3(Rtordert positionsR6tchildpos((R=s(lib/python2.7/site-packages/nltk/tree.pyR?:s    ccsa| s||r|Vnx?|D]7}t|tr"x|j|D] }|VqGWq"q"WdS(u Generate all the subtrees of this tree, optionally restricted to trees matching the filter function. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> for s in t.subtrees(lambda t: t.height() == 2): ... print(s) (D the) (N dog) (V chased) (D the) (N cat) :type filter: function :param filter: the function to filter all local trees N(RR tsubtrees(RtfilterR6tsubtree((s(lib/python2.7/site-packages/nltk/tree.pyRCTs  cCsyt|jts!tdntt|jt|g}x0|D](}t|trI||j7}qIqIW|S(u Generate the productions that correspond to the non-terminal nodes of the tree. For each subtree of the form (P: C1 C2 ... Cn) this produces a production of the form P -> C1 C2 ... Cn. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.productions() [S -> NP VP, NP -> D N, D -> 'the', N -> 'dog', VP -> V NP, V -> 'chased', NP -> D N, D -> 'the', N -> 'cat'] :rtype: list(Production) uPProductions can only be generated from trees having node labels that are strings( RRRRRRt _child_namesR t productions(RtprodsR6((s(lib/python2.7/site-packages/nltk/tree.pyRGls ! cCsVg}xI|D]A}t|tr8|j|jq |j||jfq W|S(u Return a sequence of pos-tagged words extracted from the tree. >>> t = Tree.fromstring("(S (NP (D the) (N dog)) (VP (V chased) (NP (D the) (N cat))))") >>> t.pos() [('the', 'D'), ('dog', 'N'), ('chased', 'V'), ('the', 'D'), ('cat', 'N')] :return: a list of tuples containing leaves and pre-terminals (part-of-speech tags). The order reflects the order of the leaves in the tree's hierarchical structure. :rtype: list(tuple) (RR R3tposR5R(RRIR6((s(lib/python2.7/site-packages/nltk/tree.pyRIs  cCs|dkrtdn|dfg}x|r|j\}}t|tsq|dkrd|S|d8}q-xBtt|dddD]$}|j||||ffqWq-WtddS(u, :return: The tree position of the ``index``-th leaf in this tree. I.e., if ``tp=self.leaf_treeposition(i)``, then ``self[tp]==self.leaves()[i]``. :raise IndexError: If this tree contains fewer than ``index+1`` leaves, or if ``index<0``. iuindex must be non-negativeiiu-index must be less than or equal to len(self)N((R+tpopRR trangeR(R5(RR)tstackR,ttreeposR=((s(lib/python2.7/site-packages/nltk/tree.pytleaf_treepositions    #&cCs||krtdn|j|}|j|d}xHtt|D]4}|t|ks|||||krP|| SqPW|S(u :return: The tree position of the lowest descendant of this tree that dominates ``self.leaves()[start:end]``. :raise ValueError: if ``end <= start`` uend must be greater than starti(t ValueErrorRNRKR((Rtstarttendt start_treepost end_treeposR=((s(lib/python2.7/site-packages/nltk/tree.pyttreeposition_spanning_leavess & urightiu|u^cCs-ddlm}|||||||dS(u This method can modify a tree in three ways: 1. Convert a tree into its Chomsky Normal Form (CNF) equivalent -- Every subtree has either two non-terminals or one terminal as its children. This process requires the creation of more"artificial" non-terminal nodes. 2. Markov (vertical) smoothing of children in new artificial nodes 3. Horizontal (parent) annotation of nodes :param factor: Right or left factoring method (default = "right") :type factor: str = [left|right] :param horzMarkov: Markov order for sibling smoothing in artificial nodes (None (default) = include all siblings) :type horzMarkov: int | None :param vertMarkov: Markov order for parent smoothing (0 (default) = no vertical annotation) :type vertMarkov: int | None :param childChar: A string used in construction of the artificial nodes, separating the head of the original subtree from the child nodes that have yet to be expanded (default = "|") :type childChar: str :param parentChar: A string used to separate the node representation from its vertical annotation :type parentChar: str i(tchomsky_normal_formN(tnltk.treetransformsRU(Rtfactort horzMarkovt vertMarkovt childChart parentCharRU((s(lib/python2.7/site-packages/nltk/tree.pyRUsu+cCs*ddlm}||||||dS(ul This method modifies the tree in three ways: 1. Transforms a tree in Chomsky Normal Form back to its original structure (branching greater than two) 2. Removes any parent annotation (if it exists) 3. (optional) expands unary subtrees (if previously collapsed with collapseUnary(...) ) :param expandUnary: Flag to expand unary or not (default = True) :type expandUnary: bool :param childChar: A string separating the head node from its children in an artificial node (default = "|") :type childChar: str :param parentChar: A sting separating the node label from its parent annotation (default = "^") :type parentChar: str :param unaryChar: A string joining two non-terminals in a unary production (default = "+") :type unaryChar: str i(tun_chomsky_normal_formN(RVR\(Rt expandUnaryRZR[t unaryCharR\((s(lib/python2.7/site-packages/nltk/tree.pyR\scCs'ddlm}|||||dS(u Collapse subtrees with a single child (ie. unary productions) into a new non-terminal (Tree node) joined by 'joinChar'. This is useful when working with algorithms that do not allow unary productions, and completely removing the unary productions would require loss of useful information. The Tree is modified directly (since it is passed by reference) and no value is returned. :param collapsePOS: 'False' (default) will not collapse the parent of leaf nodes (ie. Part-of-Speech tags) since they are always unary productions :type collapsePOS: bool :param collapseRoot: 'False' (default) will not modify the root production if it is unary. For the Penn WSJ treebank corpus, this corresponds to the TOP -> productions. :type collapseRoot: bool :param joinChar: A string used to connect collapsed node values (default = "+") :type joinChar: str i(tcollapse_unaryN(RVR_(Rt collapsePOSt collapseRoottjoinCharR_((s(lib/python2.7/site-packages/nltk/tree.pyR_scCsIt|trAg|D]}|j|^q}||j|S|SdS(u Convert a tree between different subtypes of Tree. ``cls`` determines which class will be used to encode the new tree. :type tree: Tree :param tree: The tree that should be converted. :return: The new Tree. N(RR tconvertR(tclsttreeR6R((s(lib/python2.7/site-packages/nltk/tree.pyRc s "cCs |jS(N(tcopy(R((s(lib/python2.7/site-packages/nltk/tree.pyt__copy__0scCs|jdtS(Ntdeep(RftTrue(Rtmemo((s(lib/python2.7/site-packages/nltk/tree.pyt __deepcopy__3scCs3|st||j|St|j|SdS(N(RRRc(RRh((s(lib/python2.7/site-packages/nltk/tree.pyRf6scCstS(N(t ImmutableTree(R((s(lib/python2.7/site-packages/nltk/tree.pyt _frozen_class=scCs|j}|dkr*|j|}nO|jdt}x+|jdD]}||||| value For example, these functions could be used to process nodes and leaves whose values should be some type other than string (such as ``FeatStruct``). Note that by default, node strings and leaf strings are delimited by whitespace and brackets; to override this default, use the ``node_pattern`` and ``leaf_pattern`` arguments. :type node_pattern: str :type leaf_pattern: str :param node_pattern, leaf_pattern: Regular expression patterns used to find node and leaf substrings in ``s``. By default, both nodes patterns are defined to match any sequence of non-whitespace non-bracket characters. :type remove_empty_top_bracketing: bool :param remove_empty_top_bracketing: If the resulting tree has an empty node label, and is length one, then return its single child instead. This is useful for treebank trees, which sometimes contain an extra level of bracketing. :return: A tree corresponding to the string representation ``s``. If this class method is called using a subclass of Tree, then it will return a tree of that type. :rtype: Tree iu"brackets must be a length-2 stringu\suwhitespace brackets not allowedu [^\s%s%s]+u%s\s*(%s)?|%s|(%s)iiu end-of-stringiuN(RRR(RtretsearchtescapeRtcompiletfinditertgroupt _parse_errortlstripR5RJtAssertionErrorR(Rdtstbracketst read_nodet read_leaft node_patternt leaf_patterntremove_empty_top_bracketingtopen_btclose_bt open_patternt close_patternttoken_reRLtmatchttokenR1RRe((s(lib/python2.7/site-packages/nltk/tree.pyt fromstringPsZ<"    ,  !  ' cCs|dkr"t|d}}n|j|j}}d|j||d|f}|jddjdd}|}t||dkr||d d}n|dkrd||d}d }n|d d|dd |f7}t|d S(u Display a friendly error message when parsing a tree string fails. :param s: The string we're parsing. :param match: regexp match of the problem token. :param expecting: what we expected to see instead. u end-of-stringu0%s.read(): expected %r but got %r %sat index %d.u i u u i u...i u %s"%s" %s^iiNu u (R(RPRxRtreplaceRO(RdR|Rt expectingRIRtmsgtoffset((s(lib/python2.7/site-packages/nltk/tree.pyRys$    cCsddlm}||dS(uP Open a new window containing a graphical diagram of this tree. i(t draw_treesN(tnltk.draw.treeR(RR((s(lib/python2.7/site-packages/nltk/tree.pytdrawscKs9ddlm}t||||j|d|dS(u Pretty-print this tree as ASCII or Unicode art. For explanation of the arguments, see the documentation for `nltk.treeprettyprinter.TreePrettyPrinter`. i(tTreePrettyPrintertfileN(tnltk.treeprettyprinterRtprintttext(Rtsentencet highlighttstreamtkwargsR((s(lib/python2.7/site-packages/nltk/tree.pyt pretty_printscCs<djd|D}dt|jt|j|fS(Nu, css|]}t|VqdS(N(R (R;tc((s(lib/python2.7/site-packages/nltk/tree.pys su %s(%s, [%s])(tjoinRRR R(Rtchildstr((s(lib/python2.7/site-packages/nltk/tree.pyt__repr__s   c Csddl}ddl}ddl}ddl}ddlm}ddlm}ddlm }|}||j |} |j | | j \} } } } dd| | f|j d<|j }dj|j}d j|j}|j||j| yK|j|d d d d gddgdtgdj||jWn6tk rtd}t|dtjtnXt|d}|j}WdQX|j||j||j|jSWdQXdS(u Draws and outputs in PNG for ipython. PNG is used instead of PDF, since it can be displayed in the qt console and has wider browser support. iN(ttree_to_treesegment(t CanvasFrame(t find_binaryiu scrollregionu{0:}.psu{0:}.pngugst binary_namesu gswin32c.exeu gswin64c.exetenv_varsuPATHtverboseuz-q -dEPSCrop -sDEVICE=png16m -r90 -dTextAlphaBits=4 -dGraphicsAlphaBits=4 -dSAFER -dBATCH -dNOPAUSE -sOutputFile={0:} {1:}uThe Ghostscript executable isn't found. See http://web.mit.edu/ghostscript/www/Install.htm If you're using a Mac, you can try installing https://docs.brew.sh/Installation then `brew install ghostscript`Rurb(tostbase64t subprocessttempfileRRtnltk.draw.utilRtnltk.internalsRtcanvast add_widgettbboxtNamedTemporaryFiletformattnamet print_to_filetdestroy_widgettcalltFalsetsplitt LookupErrortstrRtsyststderrtopentreadtremovet b64encodetdecode(RRRRRRRRt _canvas_frametwidgettxtytwthRtin_pathtout_pathtpre_error_messagetsrtres((s(lib/python2.7/site-packages/nltk/tree.pyt _repr_png_sF                cCs |jS(N(tpformat(R((s(lib/python2.7/site-packages/nltk/tree.pyt__str__;scKsCd|kr |d}|d=nd}t|j|d|dS(uH Print a string representation of this Tree to 'stream' ustreamRN(RRR(RRR((s(lib/python2.7/site-packages/nltk/tree.pytpprint>s    iFuc Csl|j|||}t|||kr/|St|jtr^d|d|j|f}n d|dt|j|f}x|D]}t|tr|dd|d|j||d|||7}qt|tr|dd|ddj |7}qt|tr<| r<|dd|dd|7}q|dd|dt|7}qW||dS( uI :return: A pretty-printed string representation of this tree. :rtype: str :param margin: The right margin at which to do line-wrapping. :type margin: int :param indent: The indentation level at which printing begins. This number is used to decide how far to indent subsequent lines. :type indent: int :param nodesep: A string that is used to separate the node from the children. E.g., the default value ``':'`` gives trees like ``(S: (NP: I) (VP: (V: saw) (NP: it)))``. u%s%s%siu u iu/u%si( t _pformat_flatR(RRRR R RR'R(RtmargintindenttnodeseptparenstquotesR|R6((s(lib/python2.7/site-packages/nltk/tree.pyRJs   3&!$cCsDtjd}|jdddddd }d tj|d |S( u Returns a representation of the tree compatible with the LaTeX qtree package. This consists of the string ``\Tree`` followed by the tree represented in bracketed notation. For example, the following result was generated from a parse tree of the sentence ``The announcement astounded us``:: \Tree [.I'' [.N'' [.D The ] [.N' [.N announcement ] ] ] [.I' [.V'' [.V' [.V astounded ] [.N'' [.N' [.N us ] ] ] ] ] ] ] See http://www.ling.upenn.edu/advice/latex.html for the LaTeX style file for the qtree package. :return: A latex qtree representation of this tree. :rtype: str u([#\$%&~_\{\}])RiRuRu[.u ]u\Tree u\\\1(u[.u ](RsRvRtsub(Rtreserved_charsR((s(lib/python2.7/site-packages/nltk/tree.pytpformat_latex_qtreerscCsg}x|D]}t|trA|j|j|||q t|tri|jdj|q t|tr| r|jd|q |jt|q Wt|jtrd|d|j|dj||dfSd|dt|j|dj||dfSdS(Nu/u%su %s%s%s %s%siu i( RR R5RR'RRR R(RRRRt childstrsR6((s(lib/python2.7/site-packages/nltk/tree.pyRs,     N((8Rt __module__t__doc__RRRRt__ne__t__gt__t__le__t__ge__R R!R"R#R&R*R-R/R0tpropertyRR1R2R4R7R9R?RCRGRIRNRTRURiR\RR_t classmethodRcRgRkRfRmRrRRyRRRRRRRRR(((s(lib/python2.7/site-packages/nltk/tree.pyR %sv?                               p#   5  ( RlcBseZddZdZdZdZdZdZdZ dZ dZ dd Z d Z d Zd Zd ZdZRS(cCsrtt|j||y"t|jt|f|_Wn0ttfk rmtdt |j nXdS(Nu-%s: node value and children must be immutable( tsuperRlRRnRR't_hashRRORR(RRR((s(lib/python2.7/site-packages/nltk/tree.pyRs "cCstdt|jdS(Nu%s may not be modified(RORR(RR)R,((s(lib/python2.7/site-packages/nltk/tree.pyR*scCstdt|jdS(Nu%s may not be modified(RORR(RR=tjR,((s(lib/python2.7/site-packages/nltk/tree.pyt __setslice__scCstdt|jdS(Nu%s may not be modified(RORR(RR)((s(lib/python2.7/site-packages/nltk/tree.pyR-scCstdt|jdS(Nu%s may not be modified(RORR(RR=R((s(lib/python2.7/site-packages/nltk/tree.pyt __delslice__scCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__iadd__scCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyt__imul__scCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyR5scCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyR3scCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyRJscCstdt|jdS(Nu%s may not be modified(RORR(RR((s(lib/python2.7/site-packages/nltk/tree.pyRscCstdt|jdS(Nu%s may not be modified(RORR(R((s(lib/python2.7/site-packages/nltk/tree.pytreversescCstdt|jdS(Nu%s may not be modified(RORR(R((s(lib/python2.7/site-packages/nltk/tree.pytsortscCs|jS(N(R(R((s(lib/python2.7/site-packages/nltk/tree.pyt__hash__scCs8t|dr+tdt|jn||_dS(u Set the node label. This will only succeed the first time the node label is set, which should occur in ImmutableTree.__init__(). u_labelu%s may not be modifiedN(thasattrRORRR(RR,((s(lib/python2.7/site-packages/nltk/tree.pyR2sN(RRRRR*RR-RRRR5R3RJRRRRR2(((s(lib/python2.7/site-packages/nltk/tree.pyRls             tAbstractParentedTreecBseZdZddZeedZedZdZ dZ dZ dZ dZ d d Zd Zeed rd ZdZdZnRS(u An abstract base class for a ``Tree`` that automatically maintains pointers to parent nodes. These parent pointers are updated whenever any change is made to a tree's structure. Two subclasses are currently defined: - ``ParentedTree`` is used for tree structures where each subtree has at most one parent. This class should be used in cases where there is no"sharing" of subtrees. - ``MultiParentedTree`` is used for tree structures where a subtree may have zero or more parents. This class should be used in cases where subtrees may be shared. Subclassing =========== The ``AbstractParentedTree`` class redefines all operations that modify a tree's structure to call two methods, which are used by subclasses to update parent information: - ``_setparent()`` is called whenever a new child is added. - ``_delparent()`` is called whenever a child is removed. cCstt|j|||dk rxBt|D]4\}}t|tr2|j||dtq2q2Wx?t|D].\}}t|trw|j||qwqwWndS(Ntdry_run( RRRRR>RR t _setparentRi(RRRR=R6((s(lib/python2.7/site-packages/nltk/tree.pyRs cCsdS(u Update the parent pointer of ``child`` to point to ``self``. This method is only called if the type of ``child`` is ``Tree``; i.e., it is not called when adding a leaf to a tree. This method is always called before the child is actually added to the child list of ``self``. :type child: Tree :type index: int :param index: The index of ``child`` in ``self``. :raise TypeError: If ``child`` is a tree with an impropriate type. Typically, if ``child`` is a tree, then its type needs to match the type of ``self``. This prevents mixing of different tree types (single-parented, multi-parented, and non-parented). :param dry_run: If true, the don't actually set the child's parent pointer; just check for any error conditions, and raise an exception if one is found. N((RR6R)R((s(lib/python2.7/site-packages/nltk/tree.pyRRcCsdS(u Update the parent pointer of ``child`` to not point to self. This method is only called if the type of ``child`` is ``Tree``; i.e., it is not called when removing a leaf from a tree. This method is always called before the child is actually removed from the child list of ``self``. :type child: Tree :type index: int :param index: The index of ``child`` in ``self``. N((RR6R)((s(lib/python2.7/site-packages/nltk/tree.pyt _delparent(RcCst|trt||dt\}}}xDt|||D]0}t||tr@|j|||q@q@Wtt|j |n t|t r|dkr|t |7}n|dkrt dnt||tr|j|||ntt|j |nt|t tfrt |dkrOt dqt |dkro||d=q||d|d=n(tdt|jt|jfdS(Nt allow_stepiuindex out of rangeu(The tree position () may not be deleted.iu#%s indices must be integers, not %s(RR%R RiRKR RRRR-R$R(R+RR'RRR(RR)RPtstoptstepR=((s(lib/python2.7/site-packages/nltk/tree.pyR-<s.  cCst|trHt||dt\}}}t|ttfsQt|}nxJt|D]<\}}t|tr^|j||||dtq^q^WxDt |||D]0}t||tr|j |||qqWxDt|D]6\}}t|tr|j||||qqWt t |j ||n_t|tr |dkrv|t|7}n|dkrtdn|||krdSt|tr|j||nt||tr|j |||nt t |j ||nt|ttfrt|dkrCtdqt|dkrf|||dR RRKRRRR*R$R(R+RRR(RR)R,RPRRR=R6((s(lib/python2.7/site-packages/nltk/tree.pyR*dsF%  cCsBt|tr(|j|t|ntt|j|dS(N(RR RR(RRR5(RR6((s(lib/python2.7/site-packages/nltk/tree.pyR5scCsSxL|D]D}t|tr5|j|t|ntt|j|qWdS(N(RR RR(RRR5(RRR6((s(lib/python2.7/site-packages/nltk/tree.pyR3s cCss|dkr|t|7}n|dkr4d}nt|trV|j||ntt|j||dS(Ni(R(RR RRRtinsert(RR)R6((s(lib/python2.7/site-packages/nltk/tree.pyRs   icCsz|dkr|t|7}n|dkr:tdnt||trd|j|||ntt|j|S(Niuindex out of range(R(R+RR RRRRJ(RR)((s(lib/python2.7/site-packages/nltk/tree.pyRJs  cCsS|j|}t||tr9|j|||ntt|j|dS(N(R)RR RRRR(RR6R)((s(lib/python2.7/site-packages/nltk/tree.pyRsu __getslice__cCs(|jttd|td|S(Ni(R&R%R8(RRPR((s(lib/python2.7/site-packages/nltk/tree.pyt __getslice__scCs(|jttd|td|S(Ni(R-R%R8(RRPR((s(lib/python2.7/site-packages/nltk/tree.pyRscCs+|jttd|td||S(Ni(R*R%R8(RRPRR,((s(lib/python2.7/site-packages/nltk/tree.pyRsN(RRRRRRRRRR-R*R5R3RRJRRRRRR(((s(lib/python2.7/site-packages/nltk/tree.pyRs   ( <     t ParentedTreecBsneZdZd dZdZdZdZdZdZ dZ dZ d Z e d ZRS( u  A ``Tree`` that automatically maintains parent pointers for single-parented trees. The following are methods for querying the structure of a parented tree: ``parent``, ``parent_index``, ``left_sibling``, ``right_sibling``, ``root``, ``treeposition``. Each ``ParentedTree`` may have at most one parent. In particular, subtrees may not be shared. Any attempt to reuse a single ``ParentedTree`` as a child of more than one parent (or as multiple children of the same parent) will cause a ``ValueError`` exception to be raised. ``ParentedTrees`` should never be used in the same tree as ``Trees`` or ``MultiParentedTrees``. Mixing tree implementations may result in incorrect parent pointers and in ``TypeError`` exceptions. cCs}d|_tt|j|||dkryxHt|D]7\}}t|tr;d|_|j||q;q;WndS(N( Rt_parentRRRR>RR R(RRRR=R6((s(lib/python2.7/site-packages/nltk/tree.pyRs   cCstS(N(tImmutableParentedTree(R((s(lib/python2.7/site-packages/nltk/tree.pyRmscCs|jS(u5The parent of this tree, or None if it has no parent.(R(R((s(lib/python2.7/site-packages/nltk/tree.pytparentscCsY|jdkrdSx-t|jD]\}}||kr#|Sq#WtsUtddS(uD The index of this tree in its parent. I.e., ``ptree.parent()[ptree.parent_index()] is ptree``. Note that ``ptree.parent_index()`` is not necessarily equal to ``ptree.parent.index(ptree)``, since the ``index()`` method returns the first child that is equal to its argument. u&expected to find self in self._parent!N(RRR>RR{(RR=R6((s(lib/python2.7/site-packages/nltk/tree.pyt parent_indexs  cCs4|j}|jr0|dkr0|j|dSdS(u6The left sibling of this tree, or None if it has none.iiN(RRR(RR((s(lib/python2.7/site-packages/nltk/tree.pyt left_siblings cCsA|j}|jr=|t|jdkr=|j|dSdS(u7The right sibling of this tree, or None if it has none.iN(RRR(R(RR((s(lib/python2.7/site-packages/nltk/tree.pyt right_siblings "cCs/|}x"|jdk r*|j}q W|S(u The root of this tree. I.e., the unique ancestor of this tree whose parent is None. If ``ptree.parent()`` is None, then ``ptree`` is its own root. N(RR(Rtroot((s(lib/python2.7/site-packages/nltk/tree.pyR#scCs7|jdkrdS|jj|jfSdS(u The tree position of this tree, relative to the root of the tree. I.e., ``ptree.root[ptree.treeposition] is ptree``. N((RRt treepositionR(R((s(lib/python2.7/site-packages/nltk/tree.pyR.scCsMt|tst|||ks+t|j|ks@td|_dS(N(RRR{RR(RR6R)((s(lib/python2.7/site-packages/nltk/tree.pyR<scCsVt|ts"tddn|jdk r@tdn|sR||_ndS(Nu"Can not insert a non-ParentedTree uinto a ParentedTreeu3Can not insert a subtree that already has a parent.(RRRRRRO(RR6R)R((s(lib/python2.7/site-packages/nltk/tree.pyREsN(RRRRRRmRRRRRRRRR(((s(lib/python2.7/site-packages/nltk/tree.pyRs        tMultiParentedTreecBseZdZd dZdZdZdZdZdZ dZ dZ d Z d Z d Zed ZRS(u  A ``Tree`` that automatically maintains parent pointers for multi-parented trees. The following are methods for querying the structure of a multi-parented tree: ``parents()``, ``parent_indices()``, ``left_siblings()``, ``right_siblings()``, ``roots``, ``treepositions``. Each ``MultiParentedTree`` may have zero or more parents. In particular, subtrees may be shared. If a single ``MultiParentedTree`` is used as multiple children of the same parent, then that parent will appear multiple times in its ``parents()`` method. ``MultiParentedTrees`` should never be used in the same tree as ``Trees`` or ``ParentedTrees``. Mixing tree implementations may result in incorrect parent pointers and in ``TypeError`` exceptions. cCs}g|_tt|j|||dkryxHt|D]7\}}t|tr;g|_|j||q;q;WndS(N( t_parentsRRRRR>RR R(RRRR=R6((s(lib/python2.7/site-packages/nltk/tree.pyRgs   cCstS(N(tImmutableMultiParentedTree(R((s(lib/python2.7/site-packages/nltk/tree.pyRmwscCs t|jS(u The set of parents of this tree. If this tree has no parents, then ``parents`` is the empty set. To check if a tree is used as multiple children of the same parent, use the ``parent_indices()`` method. :type: list(MultiParentedTree) (RR(R((s(lib/python2.7/site-packages/nltk/tree.pytparents~s cCs7g|jD]&\}}|dkr ||d^q S(u} A list of all left siblings of this tree, in any of its parent trees. A tree may be its own left sibling if it is used as multiple contiguous children of the same parent. A tree may appear multiple times in this list if it is the left sibling of this tree with respect to multiple parents. :type: list(MultiParentedTree) ii(t_get_parent_indices(RRR)((s(lib/python2.7/site-packages/nltk/tree.pyt left_siblingss cCsAg|jD]0\}}|t|dkr ||d^q S(u A list of all right siblings of this tree, in any of its parent trees. A tree may be its own right sibling if it is used as multiple contiguous children of the same parent. A tree may appear multiple times in this list if it is the right sibling of this tree with respect to multiple parents. :type: list(MultiParentedTree) i(RR((RRR)((s(lib/python2.7/site-packages/nltk/tree.pytright_siblingss cCsEg|jD]7}t|D]$\}}||kr||f^qq S(N(RR>(RRR)R6((s(lib/python2.7/site-packages/nltk/tree.pyRs cCst|jijS(u The set of all roots of this tree. This set is formed by tracing all possible parent paths until trees with no parents are found. :type: list(MultiParentedTree) (Rt_get_roots_helpertvalues(R((s(lib/python2.7/site-packages/nltk/tree.pytrootsscCsA|jr-x1|jD]}|j|qWn||t|<|S(N(RRtid(RtresultR((s(lib/python2.7/site-packages/nltk/tree.pyRs  cCsF||jkrgSgt|D]\}}||kr |^q SdS(uY Return a list of the indices where this tree occurs as a child of ``parent``. If this child does not occur as a child of ``parent``, then the empty list is returned. The following is always true:: for parent_index in ptree.parent_indices(parent): parent[parent_index] is ptree N(RR>(RRR)R6((s(lib/python2.7/site-packages/nltk/tree.pytparent_indicess cCss||krdgSg|jD]N}|j|D]8}t|D]%\}}||kr@||f^q@q0qSdS(u Return a list of all tree positions that can be used to reach this multi-parented tree starting from ``root``. I.e., the following is always true:: for treepos in ptree.treepositions(root): root[treepos] is ptree N((RR?R>(RRRRMR)R6((s(lib/python2.7/site-packages/nltk/tree.pyR?s  cCst|tst|||ks+ttg|jD]}||kr8|^q8dksetxFt|D](\}}||krr||krrPqrqrW|jj|dS(Ni(RRR{R(RR>R(RR6R)R<R=R((s(lib/python2.7/site-packages/nltk/tree.pyRs:cCsct|ts"tddn|s_x4|jD]}||kr2Pq2q2W|jj|ndS(Nu'Can not insert a non-MultiParentedTree uinto a MultiParentedTree(RRRRR5(RR6R)RR((s(lib/python2.7/site-packages/nltk/tree.pyRs N(RRRRRRmRRRRRRR R?RRR(((s(lib/python2.7/site-packages/nltk/tree.pyRUs         RcBseZRS((RR(((s(lib/python2.7/site-packages/nltk/tree.pyRsRcBseZRS((RR(((s(lib/python2.7/site-packages/nltk/tree.pyR stProbabilisticTreecBs\eZddZdZdZdZedZe dZ dZ dZ RS( cKs'tj|||tj||dS(N(R RR(RRRt prob_kwargs((s(lib/python2.7/site-packages/nltk/tree.pyRscCstS(N(tImmutableProbabilisticTree(R((s(lib/python2.7/site-packages/nltk/tree.pyRmscCsdtj||jfS(Nu %s (p=%r)(R R tprob(R((s(lib/python2.7/site-packages/nltk/tree.pyRscCs d|jdd|jfS(Nu %s (p=%.6g)Ri<(RR(R((s(lib/python2.7/site-packages/nltk/tree.pyR"scCs?|s(t||j|d|jSt|j|SdS(NR(RRRRc(RRh((s(lib/python2.7/site-packages/nltk/tree.pyRf%s"cCs}t|trug|D]}|j|^q}t|tr\||j|d|jS||j|ddSn|SdS(NRg?(RR RcRRR(RdtvalR6R((s(lib/python2.7/site-packages/nltk/tree.pyRc+s "cCsL|j|jkoK|jt||jf|jt||jfkS(N(RRRR(RR((s(lib/python2.7/site-packages/nltk/tree.pyR6s   cCst|ts"td||n|j|jkrn|jt||jf|jt||jfkS|jj|jjkSdS(Nu<(RR R RRRRR(RR((s(lib/python2.7/site-packages/nltk/tree.pyR=s N( RRRRRmRRRRfRRcRR(((s(lib/python2.7/site-packages/nltk/tree.pyR s      R cBsJeZddZdZdZdZedZe dZ RS(cKsNtj|||tj||t|jt||jf|_dS(N(RlRRRnRR'RR(RRRR ((s(lib/python2.7/site-packages/nltk/tree.pyRLscCstS(N(R (R((s(lib/python2.7/site-packages/nltk/tree.pyRmRscCsdtj||jfS(Nu%s [%s](R R R(R((s(lib/python2.7/site-packages/nltk/tree.pyRUscCs d|jdd|jfS(Nu%s [%s]Ri<(RR(R((s(lib/python2.7/site-packages/nltk/tree.pyRXscCs?|s(t||j|d|jSt|j|SdS(NR(RRRRc(RRh((s(lib/python2.7/site-packages/nltk/tree.pyRf[s"cCs}t|trug|D]}|j|^q}t|tr\||j|d|jS||j|ddSn|SdS(NRg?(RR RcRRR(RdRR6R((s(lib/python2.7/site-packages/nltk/tree.pyRcas "N( RRRRRmRRRRfRRc(((s(lib/python2.7/site-packages/nltk/tree.pyR Js      cCsPg}xC|D];}t|tr;|jt|jq |j|q W|S(N(RR R5RR(RetnamesR6((s(lib/python2.7/site-packages/nltk/tree.pyRFms  cCstddS(uE Use Tree.read(s, remove_empty_top_bracketing=True) instead. u;Use Tree.read(s, remove_empty_top_bracketing=True) instead.N(t NameError(R|((s(lib/python2.7/site-packages/nltk/tree.pyt bracket_parse|scCstjd|}xtt|D]}||dkrc||||d||d<||sR   @ z 4"   ) I