Báo cáo khoa học: "Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text" ppt

... 592–599, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics A Multi-resolution Framework for Information Extraction from Free Text Mstislav Maslennikov and Tat-Seng Chua ... evaluation methodology for the candidate templates. While the performance of the MUC4 domain is measured for each slot indi- vidually; the MUC6 task measures the perform- ance...

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

... Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text DavideTurcato Natural Language Lab School of Computing ... lexicon was used for content words. Only a bilingual lexi- con for closed class words and a set of bilingual templates were used. Therefore, new bilingual entries were obtained for all the content ... term bilingua...

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

... Parsing for Machine Translation Michel Galley Computer Science Department Stanford University Stanford, CA 94305-9020 mgalley@cs.stanford.edu Christopher D. Manning Computer Science Department Stanford ... computa- tionally expensive for high-end statistical machine translation, there are many alternative parsing al- gorithms that have seldom been explored in the machine transla...

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

... USA katrin@ee.washington.edu Abstract We propose a backoff model for phrase- based machine translation that translates unseen word forms in foreign-language text by hierarchical morphological ab- stractions ... (Zitouni et al., 2003) for language modeling and by (Gildea, 2001) for semantic role labeling. (Resnik et al., 2001) used backoff trans- lation lexicons for cross-languag...

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

... t b rooted in ε b do for all alignments α of the children of t a and t b do β(ε a ,ε b ) += P elem (t a |ε a )P align (α|ε i )  (i,j)∈α β(ε i ,ε j ) end for end for end for end for end for The outer ... probability model for tree transforma- tion operates from the top of the tree down, prob- ability estimation for aligning two trees takes place by iterating through pairs of...

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

... ap- proach for machine translation. First, we investigate three different methods for pivot translation. Then we employ a hybrid method combining RBMT and SMT systems to fill up the data gap for pivot translation, ... sentence-level translation se- lection as a machine translation (MT) evaluation problem and formalize this problem with a regres- sion learning model. For each...

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

... diversified translation systems from a single Statistical Machine Translation (SMT) engine for system combination. Our method is based on the framework of boosting. First, a se- quence of weak translation ... r i is the set of reference translations for f i . Output: a new translation system Initialize: D 1 (i) = 1 / m for all i = 1, , m For t = 1, , T 1. Train a t...

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

... re-ranking model performs rather well for a limited number of candidate structures, and out- performs Charniak’s model when k = 5. In this case we observe a small boost in performance for the detection ... candi- dates? Since no parser currently exists for the TDS representation, we utilize a state of the art parser for PS trees (Charniak, 1999), and transform each candidate to TDS. T...

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

... and stored sepa- rately for each semantic model. Next, word sense predictions are made for all test examples, with a separate learning process run for each semantic model. For learning, we are using ... algorithm does not need a separate classi- fier for each word to be disambiguated, but instead it learns global models for general word categories. 2 Background For some natural l...

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

... say that a constraint ϕ is in solved form if its graph is in solved form. A graph G is in solved form iff it is a forest. The solved forms of G are solved forms G  which are more specific than ... means that the translation is correct in these cases; 2. for nets, merging is not necessary (or even pos- sible); 3. the practical translation works perfectly for all MRS-nets from the cor...

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