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 LinguisticsDisambiguating Temporal–Contrastive Discourse Connectives for Machine TranslationThomas MeyerIdiap 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 equivalent, more re-cent database for ... signaledby a connective. For French, the ANNODIS project for anno-tation of discourse (Pery-Woodley et al., 2009)will provide an original, discourse- annotated cor-pus. Resources for Czech are also...

Tài liệu Báo cáo khoa học: "Fast Decoding and Optimal Decoding for Machine Translation" doc

... Computer ScienceUniversity of Southern California Stanford University4676 Admiralty Way, Suite 1001 Stanford, CA 94305Marina del Rey, CA 90292 jahr@cs.stanford.edugermann,knight,marcu,kyamada @isi.eduAbstractA ... Fast Decoding and Optimal Decoding for Machine TranslationUlrich Germann , Michael Jahr , Kevin Knight , Daniel Marcu , and Kenji YamadaInformation Sciences Institute Department of ... of any statistical machine translation system. The decoder’s job isto ﬁnd the translation that is most likelyaccording to set of previously learnedparameters (and a formula for combin-ing them)....

Báo cáo khoa học: "Discriminative Modeling of Extraction Sets for Machine Translation" pptx

... Association for Computational LinguisticsDiscriminative Modeling of Extraction Sets for Machine TranslationJohn DeNero and Dan KleinComputer Science DivisionUniversity of California, Berkeley{denero,klein}@cs.berkeley.eduAbstractWe ... Ultracon-servative online algorithms for multiclass problems.Journal of Machine Learning Research, 3:951–991.John DeNero and Dan Klein. 2007. Tailoring wordalignments to syntactic machine translation. In ... Evan Herbst. 2007. Moses: Opensource toolkit for statistical machine translation. InProceedings of the Annual Conference of the Associ-ation for Computational Linguistics: Demonstrationtrack.Simon...

Báo cáo khoa học: "Learning Non-Isomorphic Tree Mappings for Machine Translation" pptx

... statistical formalisms (limited to isomorphictrees), synchronous TSG allows local distortion of the tree topol-ogy. We reformulate it to permit dependency trees, and sketchEM/Viterbi algorithms for ... naturally extend to train on pairs offorests (including packed forests obtained by chart pars-ing). The correct tree is presumed to be an element ofthe forest. This makes it possible to train ... estimate a model from unaligned data.4 A Probabilistic TSG Formalism For expository reasons (and to ﬁll a gap in the literature),ﬁrst we formally present non-synchronous TSG. Let Q bea set of...

Báo cáo khoa học: "FUNCTIONAL UNIFICATION GRAMMAR: A FORMALISM FOR MACHINE TRANSLATION" doc

... 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 description ... engineering advantages are clear to see. A single formalism would straightfor- wardly reduce the number of interpreters to two, one for analysis and one for synthesis. Furthermore, the explanatory...

Báo cáo khoa học: "Computing Lattice BLEU Oracle Scores for Machine Translation" potx

... Association for Machine Translation in the America (AMTA), pages223–231.Roy W. Tromble, Shankar Kumar, Franz Och, andWolfgang Macherey. 2008. Lattice minimumbayes-risk decoding for statistical machine ... Association for Computational Linguistics, pages 120–129,Avignon, France, April 23 - 27 2012.c2012 Association for Computational LinguisticsComputing Lattice BLEU Oracle Scores for Machine TranslationArtem ... we formally deﬁne the oracle decod-ing task and recall the formalism of ﬁnite stateautomata on semirings. We then describe (Sec-tion 3) two existing approaches for solving thistask, before...

Báo cáo khoa học: "THE SPECIFICATION OF TIME MEANING FOR MACHINE TRANSLATION" pot

... 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 ... for the assignment of deictic values in particular cases is the following one : in fact, an iterative interpretation, and for such interpretations we need a more complex representation format....

Báo cáo khoa học: "Improved Word-Level System Combination for Machine Translation" doc

... 312–319,Prague, Czech Republic, June 2007.c2007 Association for Computational LinguisticsImproved Word-Level System Combination for Machine TranslationAntti-Veikko I. Rosti and Spyros Matsoukas ... improveclassification performance in various tasks. Thereare several approaches for combining classifiers. Inensemble learning, a collection of simple classifiersis used to yield better performance than ... network for the source sentence , is thenumber of translation systems, is the th systemweight, is the accumulated confidence for wordproduced by system between nodes and ,and is a weight for the...

Báo cáo khoa học: "Pattern-Based Context-Free Grammars for Machine Translation" pot

... 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 building a lexicon ... Unification-based grammar for- malisms and lexical-semantics formalisms (see LFG (Kaplan and Bresnan, 1982), HPSG (Pollard and Sag, 1987), and Generative Lexicon (Pustejovsky, 1991), for example) have...

Báo cáo khoa học: "EMPIRICAL STUDIES OF DISCOURSE REPRESENTATIONS FOR NATURAL LANGUAGE INTERFACES" ppt

... 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 form is dependent ... systems. In these cases more than one task can be performed, asking for information and giving an order. This means not only that the discourse representation needs to be more complicated,...

Xem thêm