Tài liệu Báo cáo khoa học: "Learning Sub-Word Units for Open Vocabulary Speech Recognition" doc

... s k is the sentiment label for document d k , we wish to maximize the probability of document labels given the documents. We assume documents in the collec- tion and words within a document are i.i.d. ... problems for different documents are independent, we can solve them on separate machines in parallel. This facilitates scaling the model to document collections with hundreds of thousand...

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

... that this model per- forms well on languages for which the monotone bias of existing alignment and heuristic phrase extraction approaches fail. These results open the way for the development of ... grammar formalisms permitting polynomial time inference (Wu, 1997; 783 either φ P z i for phrase pairs or φ null for single lan- guage phrases. We choose Dirichlet process (DP) priors fo...

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

... language is available for download (download.wikimedia.org) in a text format suitable for inclusion in a database. For the remainder of this paper, we refer to this format. 1 4.3 Ukrainian ... language article, if available, for additional information. • A second pass checks for multi-word phrases that exist as titles of Wikipedia articles. • We look for certain types of...

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

... tree description and/or of semantic formu- las. The XMG formalism furthermore supports the sharing of identifiers across dimension hence al- lowing for a straightforward encoding of the syn- tax/semantics ... pieces of informa- tion (fragments), and (ii) the combination of these to represent alternative syntactic structures. Describing syntax In a tree-based metagram- mar, the basic informat...

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

... alternative solution Fortunately, in data-to -speech systems like GoalGet- ter, the input of which is formed by typed and struc- tured data, a simple principle can be used for de- termining contrast. ... mentioned for the second time and therefore regarded as 'given'. However, this lack of accent creates the impression that Kluivert scored for Ajax too, whereas in fact...

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

... baselines, for any setting of combi- nation weights. Further we observe that multi- objective approaches can be helpful for optimiz- ing difficult-to-tune metrics; this is beneficial for quickly ... KDD. P. Koehn et al. 2007. Moses: open source toolkit for statistical machine translation. In ACL. A. Lavie and A. Agarwal. 2007. METEOR: An auto- matic metric for mt evaluation with hig...

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

... that for each verb, it has an accurate distribution over that inventory. We therefore compare the lexicons based on their per- formance on a task that a good SCF lexicon should be useful for: ... methods for building data-driven SCF lexicons typically rely on parsed input (see section 2). How- ever, the treebanks necessary for training a high- accuracy parsing model are expensive to bu...

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

... translations for over 50% of the cases, and at least partially correct almost 90% of the cases. 5 Conclusion and Future work We have presented a new method for finding translations on the Web for ... References G. W. Bian, H. H. Chen. Cross-language information access to multilingual collections on the internet. 2000. Journal of American Society for Information Science &...

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

... = 0.05. We run WMF on WN+Wik for 30 iterations, and LDA for 2000 iterations. For 3 It should be noted that this renders LDA a very challenging baseline to outperform. 142 Proceedings of the 50th ... defini- tions are typically too short/sparse for latent vari- able models to learn accurate semantics, since these models are designed for long documents. For exam- ple, topic models su...

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

... actions get credit for visiting the great rock after the indian country. Action a1 also gets credit for passing the great rock on the correct side. 4 Reinforcement Learning Formulation We frame ... performance of the different algorithms. Both SARSA and the policy gradient method outperform the baseline, but still fall significantly short of expert performance. The baseline policy performs...

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