QdJ7dZddlZddlmZddlmZddlmZmZm Z m Z ddl m Z Gdde Z Gd d e ZdS) a Translation model that considers how a word can be aligned to multiple words in another language. IBM Model 3 improves on Model 2 by directly modeling the phenomenon where a word in one language may be translated into zero or more words in another. This is expressed by the fertility probability, n(phi | source word). If a source word translates into more than one word, it is possible to generate sentences that have the same alignment in multiple ways. This is modeled by a distortion step. The distortion probability, d(j|i,l,m), predicts a target word position, given its aligned source word's position. The distortion probability replaces the alignment probability of Model 2. The fertility probability is not applicable for NULL. Target words that align to NULL are assumed to be distributed uniformly in the target sentence. The existence of these words is modeled by p1, the probability that a target word produced by a real source word requires another target word that is produced by NULL. The EM algorithm used in Model 3 is: :E step: In the training data, collect counts, weighted by prior probabilities. - (a) count how many times a source language word is translated into a target language word - (b) count how many times a particular position in the target sentence is aligned to a particular position in the source sentence - (c) count how many times a source word is aligned to phi number of target words - (d) count how many times NULL is aligned to a target word :M step: Estimate new probabilities based on the counts from the E step Because there are too many possible alignments, only the most probable ones are considered. First, the best alignment is determined using prior probabilities. Then, a hill climbing approach is used to find other good candidates. Notations --------- :i: Position in the source sentence Valid values are 0 (for NULL), 1, 2, ..., length of source sentence :j: Position in the target sentence Valid values are 1, 2, ..., length of target sentence :l: Number of words in the source sentence, excluding NULL :m: Number of words in the target sentence :s: A word in the source language :t: A word in the target language :phi: Fertility, the number of target words produced by a source word :p1: Probability that a target word produced by a source word is accompanied by another target word that is aligned to NULL :p0: 1 - p1 References ---------- Philipp Koehn. 2010. Statistical Machine Translation. Cambridge University Press, New York. Peter E Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, and Robert L. Mercer. 1993. The Mathematics of Statistical Machine Translation: Parameter Estimation. Computational Linguistics, 19 (2), 263-311. N defaultdict) factorial) AlignedSent AlignmentIBMModel IBMModel2)CountscFeZdZdZd fd ZfdZdZdZdZdZ xZ S) IBMModel3u$ Translation model that considers how a word can be aligned to multiple words in another language >>> bitext = [] >>> bitext.append(AlignedSent(['klein', 'ist', 'das', 'haus'], ['the', 'house', 'is', 'small'])) >>> bitext.append(AlignedSent(['das', 'haus', 'war', 'ja', 'groß'], ['the', 'house', 'was', 'big'])) >>> bitext.append(AlignedSent(['das', 'buch', 'ist', 'ja', 'klein'], ['the', 'book', 'is', 'small'])) >>> bitext.append(AlignedSent(['ein', 'haus', 'ist', 'klein'], ['a', 'house', 'is', 'small'])) >>> bitext.append(AlignedSent(['das', 'haus'], ['the', 'house'])) >>> bitext.append(AlignedSent(['das', 'buch'], ['the', 'book'])) >>> bitext.append(AlignedSent(['ein', 'buch'], ['a', 'book'])) >>> bitext.append(AlignedSent(['ich', 'fasse', 'das', 'buch', 'zusammen'], ['i', 'summarize', 'the', 'book'])) >>> bitext.append(AlignedSent(['fasse', 'zusammen'], ['summarize'])) >>> ibm3 = IBMModel3(bitext, 5) >>> print(round(ibm3.translation_table['buch']['book'], 3)) 1.0 >>> print(round(ibm3.translation_table['das']['book'], 3)) 0.0 >>> print(round(ibm3.translation_table['ja'][None], 3)) 1.0 >>> print(round(ibm3.distortion_table[1][1][2][2], 3)) 1.0 >>> print(round(ibm3.distortion_table[1][2][2][2], 3)) 0.0 >>> print(round(ibm3.distortion_table[2][2][4][5], 3)) 0.75 >>> print(round(ibm3.fertility_table[2]['summarize'], 3)) 1.0 >>> print(round(ibm3.fertility_table[1]['book'], 3)) 1.0 >>> print(round(ibm3.p1, 3)) 0.054 >>> test_sentence = bitext[2] >>> test_sentence.words ['das', 'buch', 'ist', 'ja', 'klein'] >>> test_sentence.mots ['the', 'book', 'is', 'small'] >>> test_sentence.alignment Alignment([(0, 0), (1, 1), (2, 2), (3, None), (4, 3)]) Nct|||>t||}|j|_|j|_||nA|d|_|d|_|d|_|d|_|d|_ td|D]}| |dS)a Train on ``sentence_aligned_corpus`` and create a lexical translation model, a distortion model, a fertility model, and a model for generating NULL-aligned words. Translation direction is from ``AlignedSent.mots`` to ``AlignedSent.words``. :param sentence_aligned_corpus: Sentence-aligned parallel corpus :type sentence_aligned_corpus: list(AlignedSent) :param iterations: Number of iterations to run training algorithm :type iterations: int :param probability_tables: Optional. Use this to pass in custom probability values. If not specified, probabilities will be set to a uniform distribution, or some other sensible value. If specified, all the following entries must be present: ``translation_table``, ``alignment_table``, ``fertility_table``, ``p1``, ``distortion_table``. See ``IBMModel`` for the type and purpose of these tables. :type probability_tables: dict[str]: object Ntranslation_tablealignment_tablefertility_tablep1distortion_tabler) super__init__reset_probabilitiesr rrset_uniform_probabilitiesrrrrangetrain)selfsentence_aligned_corpus iterationsprobability_tablesibm2n __class__s 3lib/python3.11/site-packages/nltk/translate/ibm3.pyrzIBMModel3.__init__s0 0111   """  %4jAAD%)%;D "#'#7D  * *+B C C C C&88K%LD "#56G#HD #56G#HD (.DG$67I$JD !q*%% 0 0A JJ. / / / / 0 0cxttfd_dS)Nc(tfdS)Nc(tfdS)Nc(tfdS)NcjSN)MIN_PROBrsr zeIBMModel3.reset_probabilities........s  r!rr)sr r*zSIBMModel3.reset_probabilities......sK8M8M8M8M,N,Nr!rr)sr r*zAIBMModel3.reset_probabilities....s $N$N$N$NOOr!rr)sr r*z/IBMModel3.reset_probabilities..sKOOOOr!)rrrrrrs`r rzIBMModel3.reset_probabilitiessJ ##%%% +    ! !    r!c t}|D]}t|j}t|j}||f|vr|||fd|z }|t jkr'tjdt|zdztd|dzD]4}td|dzD]}||j ||||<5td|j d<td|j d<td|j d<td |j d <d } d | d z z td | D]} t fd|j | <d|_dS)NzA target sentence is too long (z& words). Results may be less accurate.rcdS)Ng?r/r!r r*z5IBMModel3.set_uniform_probabilities..cr!cdS)Ng?r/r/r!r r*z5IBMModel3.set_uniform_probabilities..dr!cdS)Ng?r/r/r!r r*z5IBMModel3.set_uniform_probabilities..r0r!cdS)Ng{Gz?r/r/r!r r*z5IBMModel3.set_uniform_probabilities..r2r! g{Gz?cSr'r/)initial_fert_probsr r*z5IBMModel3.set_uniform_probabilities..ssamplerzero_indexed_alignment alignmentprob_of_alignmentsprob_t_a_given_srupdate_lexical_translationupdate_distortionupdate_null_generationupdate_fertilityrr*maximize_lexical_translation_probabilities!maximize_distortion_probabilities maximize_fertility_probabilities&maximize_null_generation_probabilities)rparallel_corpuscountsrDrErFsampled_alignmentsbest_alignment total_countalignment_infocountnormalized_countrHexisting_alignment_tables r rzIBMModel3.trains / J J $)**A$*++A26=M1N1N . )25577**  & 112DEEK#5 J J--n==#(;#6 q!a%XXA55(.!,,-=~qRSUVWWWW--.>OOO''(8.IIII J$(#7    """7 77??? ..v666 --f555 33F;;;;;r!ctj}|jD]\}}|D]\}}|D]m\}}|D]e} |j|||| |j||| z } t | ||j|||| <fndSr')rr( distortionitemsdistortion_for_any_jmaxr) rr\r(rHi_srIsrc_sentence_lengthsrEtrg_sentence_lengthsrFestimates r rXz+IBMModel3.maximize_distortion_probabilities s$'--// T TFAs+.99;; T T''/C/I/I/K/KTT+A+1TT"-a03A6q9$9!'<'<'.......QsPSr!rr/r!r r*zKModel3Counts.__init__......QsK ...Qs 4T4T(U(Ur!rr/r!r r*z'Model3Counts.__init__..QsK U UVVr!c"tdS)Nc"tdS)NcdSrr/r/r!r r*zKModel3Counts.__init__......TsCr!rr/r!r r*z9Model3Counts.__init__....Ts KK(@(@r!rr/r!r r*z'Model3Counts.__init__..TsK @ @AAr!)rrrrergr+s r rzModel3Counts.__init__NsP % V V  %0 A A% % !!!r!c|j|}|j||||xx|z cc<|j|||xx|z cc<dSr')rPrerg)rrar`rHrErFrIs r rTzModel3Counts.update_distortionWsk  $Q ' 1a ###u,### !!$Q'***e3*****r!)rxryrzr{rrTr|r}s@r rMrMHsQ      4444444r!rM)r{r@ collectionsrmathrnltk.translaterrrr nltk.translate.ibm_modelr r rMr/r!r rsEEN######FFFFFFFFFFFF++++++nnnnnnnnb44444644444r!