Báo cáo khoa học: "Boosting-based System Combination for Machine Translation" doc

... 969–976, Sydney, July 2006. c 2006 Association for Computational Linguistics Modelling lexical redundancy for machine translation David Talbot and Miles Osborne School of Informatics, University of Edinburgh 2 ... be re-enforced across the model. For instance (see Fig. 1), if cymru and gymru are clustered to- gether, the parameter for feature ψ 1 , shown above, may increase. This i...

Ngày tải lên: 17/03/2014, 04:20

... N for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do score i,j,k,m = max{score i−1,j,k,m ,score i,j−1,k,m } ; end for end for score i,j,i,j = max n=1,M;p=1,N {score i,j,i,j , ... |ref|; for i = 1; i ≤ M; i = i +1 do for j = 1; j ≤ N; j = j +1 do for k = 1; k ≤ i; k = k +1 do for m = 1; m ≤ j; m = m +1 do...

Ngày tải lên: 08/03/2014, 02:21

... of several formats. Format S (specifiers) in- volves whole constituents, including symbols and subscripts. Format A is for text, and in- volves only symbols. Both format S and for- mat A ... Massachusetts A notational system for use in writing translation routines and related programs is described. The system is specially designed to be convenient for the linguist so that...

Ngày tải lên: 16/03/2014, 19:20

... the av- erage accuracy for each reordering distance d. It shows that even for long distance reordering, the DPR model still performs well, while the MLE baseline usually performs badly (more than ... kinds of information extracted from the Input: The samples  o, φ( ¯ f j , ¯e i )  N n=1 , step size η Initialization: k = 0; w o,k = 0 ∀o ∈ Ω; Repeat for n = 1, 2, . . . , N do for o ...

Ngày tải lên: 17/03/2014, 02:20

... framework, it is straightforward to encode the morphological properties of a word, in addition to its surface inflected form. For example, for a particular inflected word form y t and its con- text, ... USA hisamis@microsoft.com Abstract We present a novel method for predicting in- flected word forms for generating morpho- logically rich languages in machine trans- lation. We utilize a...

Ngày tải lên: 17/03/2014, 04:20

... cnp  β ⎞ ⎟ ⎠ 1 β (10) 111 Table 1: Machine translation system types. System No. 1 System No. 2 System No. 3 System No. 4 System No. 5 System No. 6 Type SMT SMT RBMT SMT SMT SMT System No. 7 System No. 8 System No. 9 System ... New Quantitative Quality Measure for Machine Translation Systems. In Proc. of GOL- ING’92, 433–439. Masao Utiyama and Hitoshi Isahara. 2003...

Ngày tải lên: 23/03/2014, 16:20

... with machine translation We have integrated our system as a module in a Machine Translation system, based on Lavie et al. (2004a). The system consults the TTT clas- sifier described in section 4 for ... combination might be interpreted as a phrase since it is formed as a Hebrew noun con- struct. Recognizing them as transliteration candi- dates is crucial for improving the perfor...

Ngày tải lên: 24/03/2014, 03:20

... approach. Similar results could be expected for other suffi- ciently related languages as well. The paper con- centrates on the linguistic grounds for adopting the approach proposed. 1. INTRODUCTION ... problem, the efforts of computational linguists have been main- ly directed to the process of analysis: a unique analysis is searched (semantical and/or world knowledge informati...

Ngày tải lên: 17/03/2014, 19:21

... poly- nomial time solution for any of these hard problems (unless P = NP and P #P = P), our results highlight and justify the need for developing polynomial time ap- proximations for these computations. ... complexity. 1 Introduction Statistical Machine Translation is a data driven machine translation technique which uses proba- bilistic models of natural language for automatic tr...

Ngày tải lên: 31/03/2014, 20:20

... the system generated by the boosting- based system combination. The points at itera- tion 1 stand for the performance of the baseline systems. We see, first of all, that all the three systems ... that the boosting-based system combination seems to be more helpful to the phrase-based system than to the Hiero system and the syntax-based system. For the phrase-based syste...

Ngày tải lên: 30/03/2014, 21:20