Báo cáo khoa học: "Computational Complexity of Statistical Machine Translation" doc

... some practical ways of deal- ing with complexity. 1 Introduction Statistical Machine Translation is a data driven machine translation technique which uses proba- bilistic models of natural language ... decade, a variety of SM T algorithms have been built and empiri- cally tested whereas little is known about the computational complexity of some of the fundamental problems...

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

... result of the application of that metarule. This maximal set is called the finite closure (FC) of a set R of lexical ID rules under a set M of metarules. The cleanest possible complexity proof ... finite closure of a set of metarules M on a set of ID rules R. The category membership problem is to determine if a category or C or a legal extension of C is in the set...

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

... treaty starts as of today.” Out1 The diplomat said that ” the withdrawal of the Treaty (start) North Korea as of today. ” Out2 The diplomat said that the ” withdrawal of (North Korea of the treaty) ... that are not covered in h. The cost of the new hypothesis C(h new ) = C(h) + C(e), where C(e) is the cost of this extension. The main components of the cost of extension e can...

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

... sentence pair consists of two word sequences, e and f. A set of phrases {e ij } contains all spans e ij from between-word positions i to j of e. A link is an aligned pair of phrases, denoted (e ij , ... practice, however, the space of align- ments has to be pruned severely using word align- ments to control the running time of EM. Notably, neither of these inference approaches...

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

... number of ele- ments in each of the composed sets (assuming the sets are sorted in advance and remain so), the cal- culation of referent sets only adds a factor of to the size complexity of the ... representation of the potential referents of a quantifier such as ‘at least one’ would contain every pair of non-empty sub- sets of the set of all entities, with a cardinal- it...

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

... on Chinese- English machine translation tasks show an av- erage improvement of 0.45 BLEU and 1.22 TER points across 5 different NIST test sets. 1 Introduction Statistical machine translation ... Therefore, the set of SSRs is a subset of the phrase table. Because of this, We use the fea- tures in the phrase table to sort the rules, and keep 100 rules with highest the arithmetic m...

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

... proba- bility model for statistical machine translation. In Proceed- ings of EMNLP 2002. Melamed, I. D. (2004). Statistical machine translation by pars- ing. In Proceedings of ACL 2004. Niessen, ... smorgasbord of features for statistical machine translation. In Proceedings of HLT- NAACL 2004. Och, F. J., Tillmann, C., and Ney, H. (1999). Improved align- ment models for s...

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

... large collections of text which consist of bilingual corpora (to learn the parameters of p(s |t)), and of monolin- gual target language corpora (for p(t)). It has been shown that adding large amounts of target ... if large amounts of bilingual text are given, the training of the statistical models usually suffers from sparse data. The number of possible events, i.e. phrase p...

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

... number of para- phrasing per phrase and per sentence. The number of paraphrasing per phrase was limited to three and the number of paraphrasing per sentence was lim- ited to twice the size of the ... ambigui- ties of compound word segmentation in German, Hungarian and Turkish translation. However, to the best of our knowledge, there is no work which employed a lattice representing...

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

... O(1). The computational complexity of our method has the following components: • The complexity of finding all occurrences of the phrase in the suffix array • The complexity of retrieving the associated aligned ... table shows the efficacy of using phrases of different lengths. The ta- ble shows that while the rate of falloff is rapid, there are still multiple matches of ph...

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