Scoring and Optimization: Difference between revisions

From MT Talks
Jump to navigation Jump to search
No edit summary
No edit summary
Line 10: Line 10:


=== Phrase Translation Probabilities ===
=== Phrase Translation Probabilities ===
Phrase translation probabilities are calculated from occurrences of phrase pairs extracted from the parallel training data. Usually, MT systems work with the following two conditional probabilities:
* <math>P(\mathbf{e}|\mathbf{f})</math>
* <math>P(\mathbf{f}|\mathbf{e})</math>
These probabilities are estimated by simply counting how many times (for the first formula) we saw <math>\mathbf{e}</math> aligned to <math>\mathbf{f}</math> and how many times we saw <math>\mathbf{f}</math> in total. For example:


=== Lexical Weights ===
=== Lexical Weights ===

Revision as of 14:59, 24 August 2015

Lecture 13: Scoring and Optimization
Lecture video: web TODO
Youtube

Features of MT Models

Phrase Translation Probabilities

Phrase translation probabilities are calculated from occurrences of phrase pairs extracted from the parallel training data. Usually, MT systems work with the following two conditional probabilities:

* 
* 

These probabilities are estimated by simply counting how many times (for the first formula) we saw Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbf{e}} aligned to Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbf{f}} and how many times we saw Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathbf{f}} in total. For example:

Lexical Weights

Lexical weights are a method for smoothing the phrase table. Infrequent phrases have unreliable probability estimates; for instance many long phrases occur together only once in the corpus, resulting in Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle P(\mathbf{e}|\mathbf{f}) = P(\mathbf{f}|\mathbf{e}) = 1} . Several methods exist for computing lexical weights. The most common one is based on word alignment inside the phrase. The probability of each foreign word Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f_j} is estimated as the average of lexical translation probabilities Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle w(f_j, e_i)} over the English words aligned to it. Thus for the phrase Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (\mathbf{e},\mathbf{f})} with the set of alignment points Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a} , the lexical weight is:

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \text{lex}(\mathbf{f}|\mathbf{e},a) = \prod_{j=1}^{l_f} \frac{1}{|{i|(i,j) \in a}|} \sum_{\forall(i,j) \in a}w(f_j, e_i) }

Language Model

Word and Phrase Penalty

Distortion Penalty

Decoding

Phrase-Based Search

Decoding in SCFG

Optimization of Feature Weights