Báo cáo khoa học: "Disambiguating Temporal–Contrastive Discourse Connectives for Machine Translation" docx

... 46–51, Portland, OR, USA 19-24 June 2011. c 2011 Association for Computational Linguistics Disambiguating Temporal–Contrastive Discourse Connectives for Machine Translation Thomas Meyer Idiap Research Institute ... 2010). For German, a lexi- con of discourse connectives exists since the 1990s, namely DiMLex for lexicon of discourse markers (Stede and Umbach, 1998). An e...

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

... Computer Science University of Southern California Stanford University 4676 Admiralty Way, Suite 1001 Stanford, CA 94305 Marina del Rey, CA 90292 jahr@cs.stanford.edu germann,knight,marcu,kyamada @isi.edu Abstract A ... Fast Decoding and Optimal Decoding for Machine Translation Ulrich Germann , Michael Jahr , Kevin Knight , Daniel Marcu , and Kenji Yamada Information Sciences Institute De...

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

... Association for Computational Linguistics Discriminative Modeling of Extraction Sets for Machine Translation John DeNero and Dan Klein Computer Science Division University of California, Berkeley {denero,klein}@cs.berkeley.edu Abstract We ... Ultracon- servative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951–991. John DeNero and Dan Klein. 200...

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

... statistical formalisms (limited to isomorphic trees), synchronous TSG allows local distortion of the tree topol- ogy. We reformulate it to permit dependency trees, and sketch EM/Viterbi algorithms for ... naturally extend to train on pairs of forests (including packed forests obtained by chart pars- ing). The correct tree is presumed to be an element of the forest. This makes it possible to...

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

... UNIFICATION GRAMMAR: A FORMALISM FOR MACHINE TRANSLATION Martin Kay Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto California 94304 and CSLI, Stanford Abstract Functional ... parts: a formal description of the relevant facts about the language, and an interpreter of the formalism. The formal description is data whereas the interpreter is program. The formal d...

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

... Association for Machine Translation in the America (AMTA), pages 223–231. Roy W. Tromble, Shankar Kumar, Franz Och, and Wolfgang Macherey. 2008. Lattice minimum bayes-risk decoding for statistical machine ... Association for Computational Linguistics, pages 120–129, Avignon, France, April 23 - 27 2012. c 2012 Association for Computational Linguistics Computing Lattice BLEU Oracle...

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

... interlingual representation, namely the combination after - before. (13) has the value contain - before, and (Ib) the value before - before. In (15) the situation is different: here, the time ... to yield a formula, e.g., W(yesterday(1))=1 iff the interval I is a subset of yesterday. 35 (iii) Temporal relations that take two intervals to yield a formula, e.g., W(beforeil,J))=1...

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

... 312–319, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Improved Word-Level System Combination for Machine Translation Antti-Veikko I. Rosti and Spyros Matsoukas ... improve classification performance in various tasks. There are several approaches for combining classifiers. In ensemble learning, a collection of simple classifiers is used to yield bet...

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

... of the World-Wide Web (WWW) as information source, it has become rou- tine for Internet users to access textual data written in foreign languages. In Japan, for example, a dozen or so inexpensive ... systems based on these formalisms, on the other hand, would not be possible without much more efficient parsing and disambiguation algorithms for these formalisms and a method for...

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

... convention of means and convention of forms for indirect speech acts; the former covers Searle's analysis in terms of felicity conditions and reasons for performing an action, the latter the ... ventional form for making an indirect request, whereas Is it possible for you to open the win- dow? is not. Gibbs (1981, 1985) demonstrated then that what counts as a conventional...

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