Incremental GSC parsing (exact copy of the tutorials shared as a separate project) / __pycache__ / tree.cpython-35.pyc
1577 views
�t�W% � @ s d Z Gd d � d � Z d S)zt
GSC Software: Tree class
Author: Nick Becker
Department of Cognitive Science, Johns Hopkins University
Summer 2015
c @ sv e Z d Z d Z d d � Z d d � Z d d � Z d d � Z d
d � Z d d
� Z d d � Z
d d � Z d S)�TreezN
The last tree class you will ever need. Currently under development.
c C sK | j | � | _ g | _ | j | j d � g | _ | j | j � d S)a�
Create an internal representation of a tree by passing in a text version of it.
Formatting rules apply: trees must be passed to this method in the form
A (B A (D E))
In other words, parentheses enclose a node's children, and sister nodes are
separated by whitespace. Parentheses were chosen over brackets to avoid any
confusion when entering HNF trees, which contain many bracketed symbols.
Any symbols can be used in node labels EXCEPT parentheses, commas, and
percent signs (%).
Calling this method automatically sets the recursive-style filler-role bindings
for each node, as well as the span-style filler-role bindings for each node.
�rN)�treeStringToList�treeList�recursiveFRbindings�setRecursiveRoles�spanFRbindings� setSpanRoles)�selfZ
treeString� r
�6/projects/18c77389-a5c3-49de-946a-7593b53d3fb2/tree.py�__init__ s
z
Tree.__init__c C s� | j d d � j � } d } x� | t | � k r| | } t | � d k r| d d k so | d d k r� | d d � | | <| j | | d � | d 7} | | } | d d k s� | d d k r| d d
� | | <| j | d | d � | d 8} | d 7} q! Wd } x� | t | � d k r�| | } | | d } | d k rv| d k rv| d k rv| d k s�| d k r�| d k r�| d k r�| j | d d � | d 7} | d 7} qW| S) az
Check formatting of the input string; if it is valid, prepare it for internal
operations.
TO DO: check input string, most likely using regular expressions
- number of '(' should match number of ')'
- - len(findall(...))
- first character should be something other than ( or )
- no stray characters after final )
�,� � � �(�)N�����r r r )�replace�split�len�insert)r � inputStringZniceList�iZ
currentSymbolZ
nextSymbolr
r
r r - s2
0$
zTree.treeStringToListc C s t | � d k r� | d d k r5 t d � | } n~ | d d k rv t t | d � d � | d d � } | } n= | d d k r� | d d � } n | j j | d | f � | j | d d � | � n� d } x� | rzd } x� t t | j � d � D]t } t | j | d � t | j | d d � k r� | j | } | j | d | j | <| | j | d <d } q� Wq� Wd S) zE
Recursive function to populate recursiveFRbindings.
r r r
r Nr TF)r �str�intr �appendr �range)r Z treeNodes�levelZnewLevel� needSwappedr �tempr
r
r r Z s& ( 2
zTree.setRecursiveRolesc C s� | j | � } d } i } xd t t | � � D]P } t | | d � d k r. t | � t | d � | | | d <| d 7} q. Wd } x� | sx� t t | � � D]� } t | | d � d k r� d } d } xK | | d D]; } | | k r| | }
| |
d |
d } q� d } q� W| s� d j t t | � d | j �� } | | | | d <q� Wt | � t | � k r� d } q� Wt | � d g } xE | j � D]7 } | j d � }
|
d | | f | t
|
d � <q�W| | _ d S)
a#
A dumb, iterative function to populate spanFRbindings. Once again, probably
bad programming practice to populate a variable like this instead of returning
a value.
A nice recursive algorithm to do this task is certainly possible and would
be far more elegant, but it turned out not to be as straighforward as I initially
thought... hence the inefficient iterative algorithm here. Luckily, this
shouldn't be a problem because most users will be looking at very small
trees.
r r Fr T�keyN�%r ) � findSubTreesr r r �join�sorted�set�index�keysr r r )r r �subTreesZspanBaseZspanDictr �done�spanZ invalidSpan�childZ childSpanZ tempBindingsr! ZsplitKeyr
r
r r } s8 &
$
&zTree.setSpanRolesc C s� d } xp t t | � d � D]X } | | d k r | | d k r | | d k r | | d t | � 7<| d 7} q Wg } x1t t | � d � D]} | | d k r� | | d k r� | | d k r� g } | d } | | d k } | r�d } | d 7} x� | t | � k r�| d k r�| | d k r@| d 7} nJ | | d k r]| d 8} n- | | d k r�| d k r�| j | | � | d 7} qW| j | | | f � q� W| S) zV
Given a tree in list form, find the immediate children of each node.
r r r r
r r" r r )r r r r ) r r ZidNor r) ZcurrentChildren�jZ hasChildren�embeddedr
r
r r# � s0 0 0
!
zTree.findSubTreesc C s | j S)N)r )r r
r
r �
getFRbindings� s zTree.getFRbindingsc C s� d } x~ t t | j � � D]g } | d k r8 | d 7} | | j | d d | j | d 7} | t | j � d k r | d 7} q W| d 7} | S)zT
Gets a pretty string for the recursive-style filler-role bindings.
�{r � �/r z;
z}
)r r r )r � returnStringr r
r
r �recursiveFRtoString� s
(
zTree.recursiveFRtoStringc C s� d } x~ t t | j � � D]g } | d k r8 | d 7} | | j | d d | j | d 7} | t | j � d k r | d 7} q W| d 7} | S)zO
Gets a pretty string for the span-style filler-role bindings.
r0 r r1 r2 r z;
z}
)r r r )r r3 r r
r
r �spanFRtoString� s
(
zTree.spanFRtoStringN) �__name__�
__module__� __qualname__�__doc__r r r r r# r/ r4 r5 r
r
r
r r
s - # 2 $ r N)r9 r r
r
r
r �<module> s