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 Talgorithms have been built and empiri-cally tested whereas little is known aboutthe computational complexity of some of the fundamental problems of SMT. Ourwork aims ... Computational Complexity of Statistical Machine TranslationRaghavendra Udupa U.IBM India Research LabNew DelhiIndiauraghave@in.ibm.comHemanta K. MajiDept. o f Computer ScienceUniversity of Illinois...

Báo cáo khoa học: "COMPUTATIONAL COMPLEXITY OF CURRENT GPSG THEORY" docx

... 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 K of all categories ... of categories, FCRs are a language-particular component of the grammar. The vast number of categories cited above is inherent in the GPSG framework. SOur goal is to identify sources of complexity...

Báo cáo khoa học: "Distortion Models For Statistical Machine Translation" doc

... 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 newhypothesis C(hnew) = C(h) + C(e), where C(e) isthe cost of this extension. The main components of the cost of extension e can be deﬁned by the ... Congress of Iraqi KurdistanEng Ar House White Conﬁrms Presence of Tape New Bin LadenOrig. Eng. White House Conﬁrms Presence of New Bin Laden TapeOutput1 White House Conﬁrms Presence of Bin Laden...

Báo cáo khoa học: "The Complexity of Phrase Alignment Problems" doc

... sentence pair consists of two word sequences, eand f. A set of phrases {eij} contains all spans eijfrom between-word positions i to j of e. A link is analigned pair of phrases, denoted (eij, ... 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 of- fers any test to know ... the left of the ﬁrst word. In this paper,we assume all phrases have length at least one: j > i and l > k.25Both the conditional model of DeNero et al.(2006) and the joint model of Marcu...

Báo cáo khoa học: "Computational properties of environment-based disambiguation" docx

... number of ele-ments in each of the composed sets (assuming thesets 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 thepotential referents of a quantiﬁer such as ‘at leastone’ would contain every pair of non-empty sub-sets of the set of all entities, with a cardinal-ity on the order of . If ... the forest and the time complexity of processing it, where is the num-ber of objects and events in the run-time environ-ment. Thus, the total space and time complexity of the above algorithm...

Tài liệu Báo cáo khoa học: "Corpus Expansion for Statistical Machine Translation with Semantic Role Label Substitution Rules" doc

... on Chinese-English machine translation tasks show an av-erage improvement of 0.45 BLEU and 1.22TER 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 keep100 rules with highest the arithmetic mean of thefeature ... when we say “grammat-ical”, we do not care about the validity of the actualmeaning of the sentence.The set of SSR is a subset of the phrase table.Therefore, the features in the phrase table...

Tài liệu Báo cáo khoa học: "Clause Restructuring for Statistical Machine Translation" ppt

... 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 featuresfor statistical machine translation. In Proceedings of HLT-NAACL 2004.Och, F. J., Tillmann, C., and Ney, H. (1999). Improved align-ment models for statistical machine translation. ... represent the state of the–art in statistical machine translation.In spite of their success, a key limitation of phrase-based systems is that they make little or nodirect use of syntactic information....

Báo cáo khoa học: "Transductive learning for statistical machine translation" potx

... largecollections 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 beenshown that adding large amounts of target ... if large amounts of bilingual text are given,the training of the statistical models usually suffersfrom sparse data. The number of possible events,i.e. phrase pairs or pairs of subtrees in the ... Canada{ghaffar1,anoop}@cs.sfu.caAbstract Statistical machine translation systems areusually trained on large amounts of bilin-gual text and monolingual text in the tar-get language. In this paper we explore theuse of transductive...

Báo cáo khoa học: "Paraphrase Lattice for Statistical Machine Translation" ppt

... number of para-phrasing per phrase and per sentence. The number of paraphrasing per phrase was limited to three andthe 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, tothe best of our knowledge, there is no work whichemployed a lattice representing paraphrases of aninput ... −length(orig))The values of these features are calculated onlyif the node is the ﬁrst node of the paraphrase, forexample the second “beauty” and “salon” in line3 of Figure 2. In other nodes,...

Báo cáo khoa học: "Scaling Phrase-Based Statistical Machine Translation to Larger Corpora and Longer Phrases" pptx

... O(1).The computational complexity of our method hasthe following components:• The complexity of ﬁnding all occurrences of the phrase in the sufﬁx array• The complexity of retrieving the associatedaligned ... table shows theefﬁcacy of using phrases of different lengths. The ta-ble shows that while the rate of falloff is rapid, thereare still multiple matches of phrases of length 10.The longest ... hundreds of thousands of occurrences of common phrases, we instead sam-ple from a small subset of the occurrences. It isunlikely that we need to extract the translations of all occurrences of a...

Xem thêm