Báo cáo khoa học: "Research Methodology for Machine Translation" pptx

... different occurrences of the same form. Research Methodology 9 10 Edmundson and Hays Word: a form that represents a set of forms differing only in inflection. For example, "great" ... poration for conducting research on MT is that of convergence by successive refinements. At each stage, automatic computing machinery is used for some aspects of translation, and for collecting ... call for special definitions. Corpus: a group of articles or books selected for analysis. Form: a distinctive sequence of characters. Thus every change in spelling is a change in form;...

Tài liệu Báo cáo khoa học: "A Framework for Syntactic Translation" docx

... S1, which contains all of the information that is in the input sentence. The part of the information that is implicit in the sentence (tense, voice, and so forth) is made explicit in S1. ... certain German verb form into English, it is necessary to un- derstand the German verb form as part of a complex of features of German structure in- cluding possibly other verb forms within the ... provided so that each verb form is understood correctly as a part of that English complex. The form of an English pronoun depends on its English antecedent, while the form of a Ger- man pronoun...

Tài liệu Báo cáo khoa học: "Topic Models for Dynamic Translation Model Adaptation" pptx

... unseen for a given domain s, we are alreadyperforming an implicit form of smoothing (whencomputing the expected counts), since each docu-ment has a distribution over all topics, and thereforewe ... Meeting of the Association for Computational Linguistics, pages 115–119,Jeju, Republic of Korea, 8-14 July 2012.c2012 Association for Computational LinguisticsTopic Models for Dynamic Translation ... a sentence contributes itscounts only to the translation table for the source itcame from, many word pairs will be unobserved for a given table. This sparsity requires smoothing. Sec-ond, we...

Tài liệu Báo cáo khoa học: "HINDI TO PUNJABI MACHINE TRANSLATION SYSTEM" pdf

... module finds the root word for the token and its morphological features.Morphological analyzer developed by IIT-H has been ported for Windows platform for making it usable for this system. (Goyal ... analysis without using morphology has been performed for all those tokens that are not processed by morphological analysis module. Thus, for performing inflectional analysis, rule based approach ... translated using our Machine Translation system. 3.1 Test Document 4 For our Machine Translation system evaluation, we have used benchmark sampling method for selecting the set...

Tài liệu Báo cáo khoa học: "Phrase-Based Statistical Machine Translation as a Traveling Salesman Problem" docx

... BLEU scores as functions of time for a bigram LM; (c), (d): the same for a trigram LM. The x axis corresponds to the cumulative time for processing the test set; for (a) and (c),the y axis corresponds ... al-gorithm using a small value for the stack size andthen use it as initial point, both for the LK algo-rithm and for further Beam-Search optimization(where as before we vary the Beam-Search ... compete against one another. Inone early formulation of stack decoding for SMT(Germann et al., 2001), the authors indeed pro-posed to lazily create one stack for each subsetof source words, but...

Tài liệu Báo cáo khoa học: "Asynchronous Binarization for Synchronous Grammars" pptx

... Transforming the entire for- est to n-ary form is intractable, however, becausethe number of hyperedges would be exponential inn. Instead, we include only the top k n-ary back-traces for each forest ... Collapsing BinarizationTo facilitate a change in binarization, we transformthe translation forest into n-ary form. In the n-aryforest, each hyperedge corresponds to an originalgrammar rule, and ... CnnThese rules are also anchored to forest nodes. AnyCiremains anchored to the same node as it was inthe n-ary forest. For the new symbol B, we intro-duce a new forest node B that does not correspondto...

Tài liệu Báo cáo khoa học: "Automatic Evaluation of Machine Translation Quality Using Longest Common Subsequence and Skip-Bigram Statistics" doc

... structure. Therefore, systems optimized for these unigram-based measures might generate adequate but not fluent target language. Since BLEU has been used to report the perform-ance of many machine ... is allowed to form a skip-bigram. Applying such constraint, we limit skip-bigram formation to a fix window size. There-fore, computation time can be reduced and hope-fully performance can ... evaluate machine translations the machine translation community recently adopted an n-gram co-occurrence scoring proce-dure BLEU (Papineni et al. 2001). In two recent large-scale machine...

Tài liệu Báo cáo khoa học: "Lexical Morphology in Machine Translation: a Feasibility Study" potx

... precisely the phenomena that have to be formalized and then the prototype built up for the experiment. 4.1 Phenomena to be formalized Like in any MT project, the formalisation work has to face different ... lexicon does not contain such in-formation. Consequently, we looked for a simple way to automatically extend the Italian lexicon. For example, we looked for a way to automati-cally link relational ... if machine- learning methods would do the job. The number of LFRs being relatively restrained in producing neologisms, we can say that the effort of manual formalisation is worthwhile for...

Báo cáo khoa học: " The Work on Machine Translation in the Soviet Union" pot

... for the recording of the intermediary language can be used also for the recording of information in information machines. Along with work on the algorithms of machine translation from foreign ... language is strictly deductive and formal. This is just what deter- mines its importance both for general linguistics and for machine translation. Naturally the formal description of language ... construction of algorithms for machine translation. 5 The central problem now confronting linguists working in the field of machine translation is that of the methods of formal description of...

Báo cáo khoa học: "Syntactic Stylometry for Deception Detection" pptx

... the Association for Computational Linguistics, pages 171–175,Jeju, Republic of Korea, 8-14 July 2012.c2012 Association for Computational LinguisticsSyntactic Stylometry for Deception DetectionSong ... node, e.g., PRPˆNP4→ “you”.4 Experimental Results For all classiﬁcation tasks, we use SVM classi-ﬁer, 80% of data for training and 20% for test-ing, with 5-fold cross validation.2All featuresare ... the best performance of 91.2% accuracy,2We use LIBLINEAR (Fan et al., 2008) with L2-regulization, parameter optimized over the 80% trainingdata (3 folds for training, 1 fold for testing).3Numbers...

Xem thêm