a
     ˜ëjÜ  ã                   @   s   d dl mZ dd„ ZdS )é    )Údefaultdictc                    sÊ   dd„ |  ¡ D ƒ}dd„ |  ¡ D ƒ}g d¢‰t|ƒ t|ƒ¡‰t|ƒ t|ƒ¡‰ttƒ‰ ˆD ]$\}}ˆ d  |¡ ˆ d  |¡ q\‡ ‡‡‡‡‡fdd„}‡ ‡‡‡‡fd	d
„}|ƒ  ||ƒ ||ƒ tˆƒS )u"  
    This module symmetrisatizes the source-to-target and target-to-source
    word alignment output and produces, aka. GDFA algorithm (Koehn, 2005).

    Step 1: Find the intersection of the bidirectional alignment.

    Step 2: Search for additional neighbor alignment points to be added, given
            these criteria: (i) neighbor alignments points are not in the
            intersection and (ii) neighbor alignments are in the union.

    Step 3: Add all other alignment points that are not in the intersection, not in
            the neighboring alignments that met the criteria but in the original
            forward/backward alignment outputs.

        >>> forw = ('0-0 2-1 9-2 21-3 10-4 7-5 11-6 9-7 12-8 1-9 3-10 '
        ...         '4-11 17-12 17-13 25-14 13-15 24-16 11-17 28-18')
        >>> back = ('0-0 1-9 2-9 3-10 4-11 5-12 6-6 7-5 8-6 9-7 10-4 '
        ...         '11-6 12-8 13-12 15-12 17-13 18-13 19-12 20-13 '
        ...         '21-3 22-12 23-14 24-17 25-15 26-17 27-18 28-18')
        >>> srctext = ("ã�“ã�® ã‚ˆã�† ã�ª ãƒ�ãƒ­ãƒ¼ ç™½è‰² ã‚�ã�„ æ˜Ÿ ã�® ï¼¬ é–¢æ•° "
        ...            "ã�¯ ï¼¬ ã�¨ å…± ã�« ä¸�é€£ç¶š ã�« å¢—åŠ  ã�™ã‚‹ ã�“ã�¨ ã�Œ "
        ...            "æœŸå¾… ã�• ã‚Œã‚‹ ã�“ã�¨ ã‚’ ç¤ºã�— ã�Ÿ ã€‚")
        >>> trgtext = ("Therefore , we expect that the luminosity function "
        ...            "of such halo white dwarfs increases discontinuously "
        ...            "with the luminosity .")
        >>> srclen = len(srctext.split())
        >>> trglen = len(trgtext.split())
        >>>
        >>> gdfa = grow_diag_final_and(srclen, trglen, forw, back)
        >>> gdfa == sorted(set([(28, 18), (6, 6), (24, 17), (2, 1), (15, 12), (13, 12),
        ...         (2, 9), (3, 10), (26, 17), (25, 15), (8, 6), (9, 7), (20,
        ...         13), (18, 13), (0, 0), (10, 4), (13, 15), (23, 14), (7, 5),
        ...         (25, 14), (1, 9), (17, 13), (4, 11), (11, 17), (9, 2), (22,
        ...         12), (27, 18), (24, 16), (21, 3), (19, 12), (17, 12), (5,
        ...         12), (11, 6), (12, 8)]))
        True

    References:
    Koehn, P., A. Axelrod, A. Birch, C. Callison, M. Osborne, and D. Talbot.
    2005. Edinburgh System Description for the 2005 IWSLT Speech
    Translation Evaluation. In MT Eval Workshop.

    :type srclen: int
    :param srclen: the number of tokens in the source language
    :type trglen: int
    :param trglen: the number of tokens in the target language
    :type e2f: str
    :param e2f: the forward word alignment outputs from source-to-target
                language (in pharaoh output format)
    :type f2e: str
    :param f2e: the backward word alignment outputs from target-to-source
                language (in pharaoh output format)
    :rtype: set(tuple(int))
    :return: the symmetrized alignment points from the GDFA algorithm
    c                 S   s    g | ]}t tt| d ¡ƒƒ‘qS ©ú-©ÚtupleÚmapÚintÚsplit©Ú.0Úa© r   úR/mnt/bigstor/www/usecases/.venv/lib/python3.9/site-packages/nltk/translate/gdfa.pyÚ
<listcomp>E   ó    z'grow_diag_final_and.<locals>.<listcomp>c                 S   s    g | ]}t tt| d ¡ƒƒ‘qS r   r   r
   r   r   r   r   F   r   ))éÿÿÿÿr   )r   r   )é   r   )r   r   )r   r   )r   r   )r   r   )r   r   ÚeÚfc                     sÈ   t ˆƒd } | t ˆƒk rÄd}tˆƒD ]–}tˆƒD ]ˆ}||fˆv r0ˆD ]r}tdd„ t||f|ƒD ƒƒ}|\}}|ˆ vrD|ˆ vrD|ˆv rDˆ |¡ ˆ d  |¡ ˆ d  |¡ | d7 } d}qDq0q$|rqÄqdS )	zz
        Search for the neighbor points and them to the intersected alignment
        points if criteria are met.
        r   Tc                 s   s   | ]\}}|| V  qd S )Nr   )r   ÚiÚjr   r   r   Ú	<genexpr>c   r   z9grow_diag_final_and.<locals>.grow_diag.<locals>.<genexpr>r   r   FN)ÚlenÚranger   ÚzipÚadd)Zprev_lenZno_new_pointsr   r   ZneighborÚe_newÚf_new©ÚalignedÚ	alignmentZ	neighborsÚsrclenÚtrglenÚunionr   r   Ú	grow_diagR   s,    ÿÿþ

z&grow_diag_final_and.<locals>.grow_diagc                    sf   t ˆƒD ]X}t ˆƒD ]J}|ˆ vr|ˆ vr||fˆv rˆ ||f¡ ˆ d  |¡ ˆ d  |¡ qqdS )z¢
        Adds remaining points that are not in the intersection, not in the
        neighboring alignments but in the original *e2f* and *f2e* alignments
        r   r   N)r   r   )r   r   r   )r   r    r!   r"   r#   r   r   Ú	final_ands   s    ÿþ
ýz&grow_diag_final_and.<locals>.final_and)r	   ÚsetÚintersectionr#   r   r   Úsorted)r!   r"   Ze2fZf2er   r   r$   r%   r   r   r   Úgrow_diag_final_and   s    :!r)   N)Úcollectionsr   r)   r   r   r   r   Ú<module>   s   