Path: blob/main/a3/__pycache__/parser_transitions.cpython-310.pyc
3763 views
o
id�. � @ s� d Z ddlZG dd� de�Zdd� Zdd� Zd d
� Zd d � ZG d
d� de�Zdd� Z dd� Z
e dkr\ej Z
ee
�dkr?ed��e
d dkrMe� e� dS e
d dkrXe
� dS ed��dS )z�
CS224N 2021-2022: Homework 3
parser_transitions.py: Algorithms for completing partial parsess.
Sahil Chopra <[email protected]>
Haoshen Hong <[email protected]>
� Nc @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� PartialParsec C s" || _ dg| _|�� | _g | _dS )z�Initializes this partial parse.
@param sentence (list of str): The sentence to be parsed as a list of words.
Your code should not modify the sentence.
�ROOTN)�sentence�stack�copy�buffer� dependencies)�selfr � r
�D/Users/yimingwang/Desktop/cs224n/assignment/a3/parser_transitions.py�__init__
s
zPartialParse.__init__c C s� |dkr| j �| jd � | jd= dS |dkr+| j�| j d | j d f� | j d= dS |dkrC| j�| j d | j d f� | j d= dS dS )aa Performs a single parse step by applying the given transition to this partial parse
@param transition (str): A string that equals "S", "LA", or "RA" representing the shift,
left-arc, and right-arc transitions. You can assume the provided
transition is a legal transition.
�Sr �LA�����������RAN)r �appendr r )r �
transitionr
r
r �
parse_step) s �zPartialParse.parse_stepc C s |D ]}| � |� q| jS )a� Applies the provided transitions to this PartialParse
@param transitions (list of str): The list of transitions in the order they should be applied
@return dependencies (list of string tuples): The list of dependencies produced when
parsing the sentence. Represented as a list of
tuples where each tuple is of the form (head, dependent).
)r r )r � transitionsr r
r
r �parseB s zPartialParse.parseN)�__name__�
__module__� __qualname__r r r r
r
r
r r s r c C s� g }dd� | D �}|dd� }t |�dkrD|d|� }|�|�}t||�D ]\}} |�| �}
|js=t |j�dkr=|�|� q%t |�dksdd� |D �}|S )a� Parses a list of sentences in minibatches using a model.
@param sentences (list of list of str): A list of sentences to be parsed
(each sentence is a list of words and each word is of type string)
@param model (ParserModel): The model that makes parsing decisions. It is assumed to have a function
model.predict(partial_parses) that takes in a list of PartialParses as input and
returns a list of transitions predicted for each parse. That is, after calling
transitions = model.predict(partial_parses)
transitions[i] will be the next transition to apply to partial_parses[i].
@param batch_size (int): The number of PartialParses to include in each minibatch
@return dependencies (list of dependency lists): A list where each element is the dependencies
list for a parsed sentence. Ordering should be the
same as in sentences (i.e., dependencies[i] should
contain the parse for sentences[i]).
c S s g | ]}t |��qS r
)r )�.0r r
r
r �
<listcomp>q s z#minibatch_parse.<locals>.<listcomp>Nr � c S s g | ]}|j �qS r
)r )r r r
r
r r | s )�len�predict�zipr r r �remove) � sentences�model�
batch_sizer �partial_parsesZunfinished_parses�batchr Z
partial_parser �transr
r
r �minibatch_parseP s
� � r' c C s� t g �}||||_|_|_|�|� t|j�t|j�tt|j��}}}||ks4J d�| ||���||ksAJ d�| ||���||ksNJ d�| ||���td�| �� dS )z:Tests that a single parse step returns the expected outputz,{:} test resulted in stack {:}, expected {:}z-{:} test resulted in buffer {:}, expected {:}�6{:} test resulted in dependency list {:}, expected {:}z{:} test passed!N) r r r r r �tuple�sorted�format�print) �namer r �buf�depsZex_stackZex_buf�ex_deps�ppr
r
r � test_step� s
&
�
�
�r2 c C sX t ddddgddgg ddd � t d
d g d�dgg d dd
� t ddg d�g g dd d� dS )z`Simple tests for the PartialParse.parse_step function
Warning: these are not exhaustive
�SHIFTr
r �the�cat�sat)r r4 r5 )r6 r
zLEFT-ARCr )r r5 ))r5 r4 z RIGHT-ARCr )r �run�fast)r r7 ))r7 r8 N)r2 r
r
r
r �test_parse_step� s ���r9 c C sb g d�} t | ��g d��}tt|��}d}||ks!J d�||���t| �dks+J d��td� dS )z[Simple tests for the PartialParse.parse function
Warning: these are not exhaustive
)r �thisr )r
r
r
r r r ))r r )r r )r r: z5parse test resulted in dependencies {:}, expected {:}z<parse test failed: the input sentence should not be modifiedzparse test passed!N)r r r) r* r+ r, )r r �expectedr
r
r �
test_parse� s
�� r< c @ s2 e Zd ZdZd dd�Zdd� Zdd� Zd d
� Zd S )
�
DummyModelz9Dummy model for testing the minibatch_parse function
�unidirectionalc C s
|| _ d S )N��mode)r r@ r
r
r r � s
zDummyModel.__init__c C s. | j dkr
| �|�S | j dkr| �|�S t� �)Nr> �
interleave)r@ �unidirectional_predict�interleave_predict�NotImplementedError�r r$ r
r
r r � s
zDummyModel.predictc C � dd� |D �S )z�First shifts everything onto the stack and then does exclusively right arcs if the first word of
the sentence is "right", "left" if otherwise.
c S s4 g | ]}t |j�d kr|jd du rdndnd�qS )r r �rightr r r
�r r r �r r1 r
r
r r � s ,�z5DummyModel.unidirectional_predict.<locals>.<listcomp>r
rE r
r
r rB � s �z!DummyModel.unidirectional_predictc C rF )zXFirst shifts everything onto the stack and then interleaves "right" and "left".
c S s8 g | ]}t |j�d krt |j�d d krdndnd�qS )r � r r r
rH rI r
r
r r � s 0�z1DummyModel.interleave_predict.<locals>.<listcomp>r
rE r
r
r rC � s �z DummyModel.interleave_predictN)r> )r r r �__doc__r r rB rC r
r
r
r r= � s
r= c C s* t t|��}||ksJ d�| ||���dS )z?Tests the provided dependencies match the expected dependenciesr( N)r) r* r+ )r- r/ r0 r
r
r �test_dependencies� s
�rL c C s� g d�g d�g d�g d�g} t | t� d�}td|d d� td|d d
� td|d d � td|d d
� dgg} t | t� d�}td|d d� g d�g} t | tdd�d �}td|d d� td� dS )zXSimple tests for the minibatch_parse function
Warning: these are not exhaustive
)rG �arcs�only)rG rM rN �again)�leftrM rN )rP rM rN rO rJ r' r )�r rG �rM rN �rG rM r )rQ rR )rN rO rS ))rN r )rN rM )rN rP � ))rO r )rO rM )rO rP )rO rN rG )rQ )r: �is� interleaving�
dependency�testrA r? ))r rU )rW rV )rW rX )rU rW )rU r: z minibatch_parse test passed!N)r' r= rL r, )r! r/ r
r
r �test_minibatch_parse� s6 �
�
�
�
�
� rY �__main__rJ zdYou did not provide a valid keyword. Either provide 'part_c' or 'part_d', when executing this scriptr Zpart_cZpart_d)rK �sys�objectr r' r2 r9 r< r= rL rY r �argv�argsr � Exceptionr
r
r
r �<module> s* D2 "
�