Báo cáo khoa học: "Filtering Syntactic Constraints for Statistical Machine Translation" pdf

... reordering constraints for statis- tical machine translation. A lot of effort has been made for soft applications of syntactic constraints. We alternatively propose the se- lective use of syntactic constraints. ... 17–21, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Filtering Syntactic Constraints for Statistical Machine Transl...

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

... Association for Computational Linguistics, pages 834–843, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Bilingual Sense Similarity for Statistical Machine Translation ... units. Therefore, questions emerge: how good is the sense similarity computed via VSM for two units from parallel corpora? Is it useful for multi- lingual applications,...

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

... Boks 1080 Blindern; 0316 Oslo (Norway) ♠ Center for the Study of Language and Information, Stanford, CA 94305 (USA) { jtl@ifi.uio.no| oe@csli.stanford.edu} Abstract The LOGON MT demonstrator assembles independently ... Presentation Sessions, pages 53–56, Sydney, July 2006. c 2006 Association for Computational Linguistics Re-Usable Tools for Precision Machine Translation ∗ Jan Tore Lø...

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

... end for 12: end for 13: for each hypothesis           do 14: compute HM decoding features for  15: add  to     16: end for 17: for ... BTG-based HM Decoding 1: for each component model   do 2: output the search space    for the input  3: end for 4: for  to      do 5: for all   s...

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

... 1) for j = 1 to qc(x) do for i = 1 to k do h i (x) ← hash of event {x, j} under h i BF[h i (x)] ← 1 end for end for end for return BF 3.1 Log-frequency Bloom filter The efficiency of our scheme for ... 2007. c 2007 Association for Computational Linguistics Randomised Language Modelling for Statistical Machine Translation David Talbot and Miles Osborne School of Informatics,...

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

... Association for Computational Linguistics:shortpapers, pages 176–181, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Better Hypothesis Testing for Statistical Machine ... experimen- tal outcomes, and make recommendations for reporting results more accurately. 1 Introduction The need for statistical hypothesis testing for ma- chine trans...

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

... Association for Computational Linguistics:shortpapers, pages 182–187, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Bayesian Word Alignment for Statistical Machine ... Initialize A 2 for k = 1 to K do 3 for each sentence-pair s in (E, F) do 4 for j = 1 to J do 5 for i = 0 to I do 6 Calculate P (a j = i| · · · ) according to (7) 7 Sampl...

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

... 2011. c 2011 Association for Computational Linguistics Pre- and Postprocessing for Statistical Machine Translation into Germanic Languages Sara Stymne Department of Computer and Information Science Link ¨ oping ... which can both moti- vate and evaluate the studies performed. 1 Introduction Statistical machine translation (SMT) is based on training statistical models from large...

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

... Using POS Information for Statistical Machine Translation into Morphologically Rich Languages Nicola Ueffing and Hermann Ney Lehrstuhl ftir Informatik VI - Computer Science ... lan- guages, the English word forms often do not contain enough information for producing the correct fullform in the target language. We investigate meth- ods for improving the quality of such translations...

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

... Poster Sessions, pages 105–112, Sydney, July 2006. c 2006 Association for Computational Linguistics Soft Syntactic Constraints for Word Alignment through Discriminative Training Colin Cherry Department ... Transduction Grammar or ITG formalism, described in (Wu, 1997), is well suited for our purposes. ITGs per- form string-to-string alignment, but do so through a parsing algorithm...

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