/hT*~SSKrSSKJr "SS5r"SS\5rSrSrS r\"S S S /5r "S S5r g)N) namedtuplec~\rSrSrSrSSjr\S5r\S5rSr Sr \"\ \ 5r S r S r S rS rS rSrg) AlignedSenta Return an aligned sentence object, which encapsulates two sentences along with an ``Alignment`` between them. Typically used in machine translation to represent a sentence and its translation. >>> from nltk.translate import AlignedSent, Alignment >>> algnsent = AlignedSent(['klein', 'ist', 'das', 'Haus'], ... ['the', 'house', 'is', 'small'], Alignment.fromstring('0-3 1-2 2-0 3-1')) >>> algnsent.words ['klein', 'ist', 'das', 'Haus'] >>> algnsent.mots ['the', 'house', 'is', 'small'] >>> algnsent.alignment Alignment([(0, 3), (1, 2), (2, 0), (3, 1)]) >>> from nltk.corpus import comtrans >>> print(comtrans.aligned_sents()[54]) 'So why should EU arm...'> >>> print(comtrans.aligned_sents()[54].alignment) 0-0 0-1 1-0 2-2 3-4 3-5 4-7 5-8 6-3 7-9 8-9 9-10 9-11 10-12 11-6 12-6 13-13 :param words: Words in the target language sentence :type words: list(str) :param mots: Words in the source language sentence :type mots: list(str) :param alignment: Word-level alignments between ``words`` and ``mots``. Each alignment is represented as a 2-tuple (words_index, mots_index). :type alignment: Alignment NcxXlX lUc[/5Ulg[ U5[LdeX0lgN)_words_mots Alignment alignmenttype)selfwordsmotsr s J/var/www/auris/envauris/lib/python3.13/site-packages/nltk/translate/api.py__init__AlignedSent.__init__/s4   &r]DN ?i/ //&NcUR$r)r rs rrAlignedSent.words8s {{rcUR$r)r rs rrAlignedSent.mots<s zzrcUR$r) _alignmentrs r_get_alignmentAlignedSent._get_alignment@s rcv[[UR5[UR5U5 Xlgr)_check_alignmentlenrrr)rr s r_set_alignmentAlignedSent._set_alignmentCs#TZZ#dii.)D#rcSSRSUR55-nSSRSUR55-nSUSUSUR<S3$)zG Return a string representation for this ``AlignedSent``. :rtype: str z[%s]z, c3,# UH nSU-v M g7fz'%s'N.0ws r 'AlignedSent.__repr__..Os#D 1FQJ c3,# UH nSU-v M g7fr%r&r's rr*r+Ps"Bz!6A:zr,z AlignedSent())joinr r r)rrrs r__repr__AlignedSent.__repr__Is^ $))#D #DDE"Btzz"BBCeWBtfBt.ACCrc SnUS- nUSRURVs/sH nSUSUS3PM sn5- nUSRURVs/sH nSUSUS3PM sn5- nUSRURVVs/sH(up4SURUSURUS 3PM* snn5- n[ [ UR5S - 5H5nUS R URUURUS -5- nM7 [ [ UR5S - 5H5nUS R URUURUS -5- nM7 US SRSUR55-- nUS SRSUR55-- nUS- nU$s snfs snfs snnf)z, Dot representation of the aligned sentence zgraph align { znode[shape=plaintext] "z_source" [label="z"] z_target" [label="z _source" -- "z _target" z)"{}_source" -- "{}_source" [style=invis] z)"{}_target" -- "{}_target" [style=invis] z{rank = same; %s}  c3,# UH nSU-v M g7f)z "%s_source"Nr&r's rr*&AlignedSent._to_dot..vs.V+Q}q/@+r,c3,# UH nSU-v M g7f)z "%s_target"Nr&r's rr*r8ws.U*Q}q/@*r,})r/r r rranger format)rsr)uvis r_to_dotAlignedSent._to_dotTs  && RWW L 1!-aS6 L MM RWW K 1!-aS6 K LL RWW!OO +DADKKN#=A{K+   s4;;'!+,A =DD A AE" A-s4::*+A =DD 1  1q5! A, "chh.V$++.V&V WW "chh.U$**.U&U VV S?MK sG G /G cVUR5RS5nSn[R"SSU-/[R[R[RS9nURU5upVURS5$![ an[ S5UeSnAff=f)zB Ipython magic : show SVG representation of this ``AlignedSent``. utf8svgdotz-T%s)stdinstdoutstderrz0Cannot find the dot binary from Graphviz packageN) rAencode subprocessPopenPIPEOSError Exception communicatedecode)r dot_string output_formatprocesseouterrs r _repr_svg_AlignedSent._repr_svg_}s\\^**62   W &&./ oo!! G&&z2zz&!!  WNOUV V WsAB B( B##B(cSRUR5SSS-nSRUR5SSS-nSUSUS3$)zV Return a human-readable string representation for this ``AlignedSent``. :rtype: str r6Nz...z 'z'>)r/r r )rsourcetargets r__str__AlignedSent.__str__sU $++&s+e3$**%cr*U2 vhb99rct[URURURR 55$)zU Return the aligned sentence pair, reversing the directionality :rtype: AlignedSent )rr r rinvertrs rraAlignedSent.inverts( 4::t{{DOO4J4J4LMMr)rr r r r)__name__ __module__ __qualname____firstlineno____doc__rpropertyrrrr!r r0rArXr^ra__static_attributes__r&rrrrsh>'$8I D'R"&:NrrcV\rSrSrSrSr\S5rSrSr S Sjr S r S r S r S rg)r a  A storage class for representing alignment between two sequences, s1, s2. In general, an alignment is a set of tuples of the form (i, j, ...) representing an alignment between the i-th element of s1 and the j-th element of s2. Tuples are extensible (they might contain additional data, such as a boolean to indicate sure vs possible alignments). >>> from nltk.translate import Alignment >>> a = Alignment([(0, 0), (0, 1), (1, 2), (2, 2)]) >>> a.invert() Alignment([(0, 0), (1, 0), (2, 1), (2, 2)]) >>> print(a.invert()) 0-0 1-0 2-1 2-2 >>> a[0] [(0, 1), (0, 0)] >>> a.invert()[2] [(2, 1), (2, 2)] >>> b = Alignment([(0, 0), (0, 1)]) >>> b.issubset(a) True >>> c = Alignment.fromstring('0-0 0-1') >>> b == c True c[RX5nU[/5:wa[SU55OSUlSUlU$)Nc3*# UH oSv M g7frNr&r(ps rr*$Alignment.__new__..s+d!dr) frozenset__new__max_len_index)clspairsrs rrtAlignment.__new__s=  ,/3y}/DC+d++!   rcr[UR5Vs/sHn[U5PM sn5$s snf)a] Read a giza-formatted string and return an Alignment object. >>> Alignment.fromstring('0-0 2-1 9-2 21-3 10-4 7-5') Alignment([(0, 0), (2, 1), (7, 5), (9, 2), (10, 4), (21, 3)]) :type s: str :param s: the positional alignments in giza format :rtype: Alignment :return: An Alignment object corresponding to the string representation ``s``. )r split _giza2pair)rxr=as r fromstringAlignment.fromstrings+;A*Q-;<<;s4czUR(dUR5 URRU5$)z> Look up the alignments that map from a given index or slice. )rw _build_index __getitem__)rkeys rrAlignment.__getitem__s,{{    {{&&s++rc&[SU55$)z9 Return an Alignment object, being the inverted mapping. c3@# UHoSUS4USS-v M g7f)r5rNr&ros rr*#Alignment.invert..s%>AQ41,12.s)r rs rraAlignment.inverts>>>>rNc&[5nUR(dUR5 U(d'[[ [ UR555nUH(nUR SURU55 M* [U5$)z Work out the range of the mapping from the given positions. If no positions are specified, compute the range of the entire mapping. c3*# UH upUv M g7frr&)r(_fs rr*"Alignment.range..s6~tq~rr)setrwrlistr;r updatesorted)r positionsimagerps rr;Alignment.rangesg {{    U3t{{#345IA LL6t{{1~6 6e}rcS[U5-$)= Produce a Giza-formatted string representing the alignment. z Alignment(%r))rrs rr0Alignment.__repr__s--rcDSRS[U555$)rr6c32# UH nSUSS-v M g7f)z%d-%dNrr&ros rr*$Alignment.__str__..s>A!BQ%s)r/rrs rr^Alignment.__str__sxx>>>>rc[URS-5Vs/sHn/PM snUlUH$nURUSRU5 M& gs snf)zh Build a list self._index such that self._index[i] is a list of the alignments originating from word i. r5rN)r;rvrwappend)rrrps rrAlignment._build_indexsS $)Q#78#7ar#78 A KK!  $ $Q '9s A)rwrvr)rcrdrerfrgrt classmethodrrrar;r0r^rrir&rrr r s>2  = =,? . ? (rr cTURS5up[U5[U54$N-r|int) pair_stringr@js rr}r}s&   S !DA q63q6>rcVURS5upn[U5[U54$rr)rr@rrps r _naacl2pairr s($GA! q63q6>rc^^[U5[Lde[U4SjU55(d [S5e[U4SjU55(d [S5eg)a> Check whether the alignments are legal. :param num_words: the number of source language words :type num_words: int :param num_mots: the number of target language words :type num_mots: int :param alignment: alignment to be checked :type alignment: Alignment :raise IndexError: if alignment falls outside the sentence c3T># UHnSUSs=:*=(a T:Os v M g7frnr&)r(pair num_wordss rr*#_check_alignment..s%>IDqDG''i''Is%(z&Alignment is outside boundary of wordsc3n># UH*oSSL=(d SUSs=:*=(a T:Os v M, g7f)r5Nrr&)r(rnum_motss rr*r s0PidAw$9!tAw"9"9"99is25z%Alignment is outside boundary of motsN)r r all IndexError)rrr s`` rrrsW  ?i '' ' >I> > >ABB PiP P P@AA QrPhraseTableEntry trg_phraselog_probc0\rSrSrSrSrSrSrSrSr g) PhraseTablei'zg In-memory store of translations for a given phrase, and the log probability of the those translations c"[5Ulgr)dict src_phrasesrs rrPhraseTable.__init__-s 6rc URU$)a} Get the translations for a source language phrase :param src_phrase: Source language phrase of interest :type src_phrase: tuple(str) :return: A list of target language phrases that are translations of ``src_phrase``, ordered in decreasing order of likelihood. Each list element is a tuple of the target phrase and its log probability. :rtype: list(PhraseTableEntry) rr src_phrases rtranslations_forPhraseTable.translations_for0s ++rc[X#S9nXR;a/URU'URURU5 URURSSS9 g)z :type src_phrase: tuple(str) :type trg_phrase: tuple(str) :param log_prob: Log probability that given ``src_phrase``, ``trg_phrase`` is its translation :type log_prob: float )rrcUR$r)r)rUs r!PhraseTable.add..Ls rT)rreverseN)rrrsort)rrrrentrys raddPhraseTable.add?sb!JJ -- -+-D  Z ( $++E2 $)).BD)QrcXR;$rrrs r __contains__PhraseTable.__contains__Ns----rrN) rcrdrerfrgrrrrrir&rrrr's " , R.rr) rK collectionsrrrsr r}rrrrr&rrrsZ"QNQNh_( _(D  B*0<2LM(.(.r