unsupervised learning of acoustic

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

... candidates. Of the 740 cloze tests, 714 of the removed events were present in their respective list of guesses. This is encouraging as only 3.5% of the events are unseen (or do not meet cutoff thresholds). When ... thus a tuple of the event and the typed dependency of the protagonist: (event, depen- dency). A narrative chain is a set of narrative events {e 1 , e 2 , , e n }, where n is the size of the chain, ... specifically on learning narratives 1 , our work draws from two lines of research in summarization and anaphora resolu- tion. In summarization, topic signatures are a set of terms indicative of a topic...

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

Ngày tải lên: 08/03/2014, 04:22

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

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

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

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

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

... of EM contain valuable information about the incor- rect biases of these models. However, EM is chang- ing hundreds of thousands of parameters at once in a non-trivial way, so we need a way of ... take a step back and present a more statistical view of unsupervised learning in the context of grammar induction. We identify four types of error that a system can make: approxima- tion, identifiability, ... face of label symmetry and ran experiments exploring the effectiveness of EM as a function of the amount of data. Finally, we hope that setting up the general framework to understand the errors of...

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

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

... the theories of second language learning: definitions of language acquisition and theoretical background of language learning factors in specific such as intelligence, personality, learning strategies, ... well as environment and context of learning. 2.2. Definitions of language acquisition “Language acquisition is one of the most impressive and fascinating aspects of human development” (Lightbown, ... process of the first language learning can be better understood if the social dimension is included. Social factors have even more importance in the case of second language learning because of the...

Ngày tải lên: 07/11/2012, 15:04

Ngày tải lên: 07/09/2013, 13:00

... x. By relating the sum of the scores of all possible trees to counting the number of spanning trees in a graph, it can be shown that Z x is the determinant of the Kirchoff matrix K, which is ... marginal probability of a particular edge k → i (i.e. y i =k), the score of any edge k  → i such that k  = k is set to 0. The determinant of the resulting modi- fied Kirchoff matrix K k→i is then the sum of ... of constraints accuracy attach right baseline DMV EM DMV CE CRF restricted GE CRF GE CRF GE human Figure 2: Comparison of GE training of the re- stricted and full CRFs with unsupervised learning...

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

... sequence of Colloc(ations), each of which consists of a sequence of Words. sible for an adaptor grammar to generate a sentence as a sequence of collocations, each of which con- sists of a sequence of ... expands to each of the 50 dis- tinct phonemes present in the Brent corpus. This grammar defines a Sentence to consist of a sequence of Words, where a Word consists of a sequence of Phonemes. The ... Johnson. 2005. Repre- sentational bias in unsupervised learning of syllable structure. In Proceedings of the Ninth Conference on Computational Natural Language Learning (CoNLL- 2005), pages 112–119,...

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

... tractable amount of time, since according to the Markov as- 2 Often these are more complicated than picking informative features as proposed in this paper. One example of the kind of operator used ... same method as HK06, the first 33 of which are also shown in Table 1. We use the same tokenization of the dataset as HK06, and training/test /unsupervised sets of 100 instances each. This data ... Semi-Supervised Learning of Conditional Random Fields Gideon S. Mann Google Inc. 76 Ninth Avenue New York, NY 10011 Andrew McCallum Department of Computer Science University of Massachusetts 140...

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

... ex- amples of the previous section. From the point of view of bag -of- word methods, the pairs (T 1 , H 1 ) and (T 1 , H 2 ) have both the same intra-pair simi- larity since the sentences of T 1 and ... head of constituents. The example of Fig. 1 shows that the placeholder 0 climbs up to the node governing all the NPs. 5.3 Pruning irrelevant information in large text trees Often only a portion of ... t, the set of its nodes N (t), and a set of anchors, we build a tree t  with all the nodes N  that are anchors or ancestors of any anchor. Moreover, we add to t  the leaf nodes of the original...

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

... algorithm to perform WSD on a set of polysemous English words. They report an accu- racy of 74%. One of the most active researchers in identify- ing cognates between pairs of languages is Kondrak ... we show that nonetheless machines are capable of learning from new information, using an iterative approach, similar to the learning process of hu- mans. New information was collected and ... Studies of Intelligence, pp.44- 59. Grzegorz Kondrak. 2001. Identifying Cognates by Phonetic and Semantic Similarity. Proceedings of NAACL 2001: 2nd Meeting of the North American Chapter of the...

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

... 0.6 0.7 0.8 0.9 1 10 100 1000 10000 100000 1e+06 size(KB) recall precision 434 Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 428–435, Sydney, July 2006. c 2006...

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