| C04-1091 | Dynamic Programming for solving | FIXED ALIGNMENT DECODING | efficiently . Note that each |
| C04-1091 | time algorithm for the problem | FIXED ALIGNMENT DECODING | . Recall that in FIXED ALIGNMENT |
| C04-1091 | 4 A Linear Time Algorithm for | FIXED ALIGNMENT DECODING | A key component of all our algorithms |
| C04-1091 | optimal translation ^ e by solving | FIXED ALIGNMENT DECODING | , i.e. , ^ e = argmaxe Pr ( f |
| C04-1091 | problem specified by Equation 4 as | FIXED ALIGNMENT DECODING | . What Observation 1 is saying |
| C04-1091 | later , the optimal solution for | FIXED ALIGNMENT DECODING | can be com - puted in O ( m ) |
| C04-1091 | ALIGNMENT DECODING . Recall that in | FIXED ALIGNMENT DECODING | , we are given the target length |
| C04-1091 | translation e for f by solving | FIXED ALIGNMENT DECODING | . For this purpose it employs |
| C04-1091 | iteration it solves two subproblems : | FIXED ALIGNMENT DECODING | and VITERBI ALIGNMENT . The input |
| C04-1091 | ( f , ~ a | e ) Pr ( e ) . As | FIXED ALIGNMENT DECODING | can be solved in O ( m ) time |
