Tài liệu Báo cáo khoa học: "Hidden Markov Tree Model in Dependency-based Machine Translation∗" pptx

... Hid- den Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly successful Hidden Markov (Chain) Models. In dependency trees, the ... Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, pages 145–148, Suntec, Singapore, 4 August 2009. c 2009 ACL and AFNLP Hidden Markov Tree Model in Dep...

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

... results in line - are obtained by training ’float’ weights only. Here, the training is carried out by running only once over % of the training data. The model including the binary features is trained ... change in perfor- mance between training on the original training data in Eq. 2 or on the modified training data in Eq. 10. Line shows that even when training the float weights on an e...

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

... parsing. In Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together, pages 26–33. Liang Huang and Haitao Mi. 2010. Efficient incremental decoding for tree- to-string ... Schabes, and Aravind K. Joshi. 1990. Using lexicalized tree adjoining grammars for machine translation. In Proceedings of the 13th Inter- national Conference on Computational Li...

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

... of words in the input. Adding the swapping operation changes the time complexity for deterministic parsing from linear to quadratic in the worst case, but empirical estimates based on treebank ... score. 1 Introduction Syntactic parsing using dependency structures has become a standard technique in natural language processing with many different parsing models, in particular data-driv...

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

... domains: text news, trained on a large cor- pus, and spoken travel conversation, trained on a sig- nificantly smaller corpus. We show that segmenting the Arabic target in training and decoding ... For example, mdy +P:3MS recombines to mdAh ’its extent’, since the ’y’ is actually a Y; but fy +P:3MS recombines to fyh in it’. 3. Word Ambiguity: In some cases, a word can recombine into 2 gram...

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

... documents in the training corpus from L lan- guages. Since each language has at least one document in the training corpus, we have D L≥ . is the number of documents containing the word w . Letting ... in Eq.(1) involves sum- ming over all possible decoding of token se- quences T given O . In many implementations, it is approximated by the maximum over all se- quences in the...

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

... that we will have to ob- tain one ME model for each target word observed in the training data. 4 Contextual information and training events In order to train the ME model associated to a target ... shown in Table 5. 6.2 Training and test perplexities In order to compute the training and test perplex- ities, we split the whole aligned training corpus in two parts as shown in Ta...

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

... choosing a good TSP tour. Because any TSP problem instance can be transformed into a de- coding problem instance, Model 4 decoding is provably NP-complete in the length of f. It is interesting ... to right, but allowing the decoder to consume its input in any order. This change makes decod- ing significantly more complex in MT; instead of knowing the order of the input in advance, we...

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

... (Niehren and Koller, 1998) if binding and linking relations in A-structures are ignored. For the interaction of binding with parallelism we follow the basic idea that binding relations should be ... variable-capturing when instan- tiating underspecified scope representations. In principle, capturing may occur in all formalisms for structural underspecification which repre- sent...

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

... bracketing transduction grammars. The bigram lan- guage model is integrated into the algorithm at the point, where two partial parse trees are combined. 2 DP Search 2.1 The Inverted Alignment Model ... are extended 961 by adding a word to the end of the target string while considering the source string words in any or- der. The underlying translation model is Model 2 from...

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