bayesian learning of noncompositional phrases

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

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

... this paper was twofold. Firstly, we wanted to compare the performance of different machine learning algorithms on the task of map- ping from a vector of web frequencies of para- phrases containing ... relation. 2.2 Machine Learning Algorithms We are also interested in comparing the perform- ance of machine learning algorithms on the task of mapping from n-gram frequencies of joining terms to ... of a predi- cate verb or preposition (Levi 1978). However, whether the set of possible predicates numbers 5 or 50, there are likely to be some examples of noun phrases that fit into none of...

Ngày tải lên: 20/02/2014, 12: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

Ngày tải lên: 26/11/2013, 13:25

Ngày tải lên: 14/12/2013, 00:40

... 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 ... basic types of linguistic knowledge. One simple form of linguistic knowledge is the set of possible parent tags for a given child tag. This type of constraint was used in the devel- opment of a rule-based...

Ngày tải lên: 20/02/2014, 07: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 ... 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 ... addition of lower cost unlabeled data. Tradi- tional approaches to semi-supervised learning are applied to cases in which there is a small amount of fully labeled data and a much larger amount of un- labeled...

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 ... A  reasonably small. To reduce the number of placeholders, we con- sider the notion of chunk defined in (Abney, 1996), i.e., not recursive kernels of noun, verb, adjective, and adverb phrases. When placeholders ... 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...

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

... translation of noun phrases. They constitute soft constraints that may be over- ruled by other components of the system. 5 Results As described in Section 3.1, we evaluate the per- formance of our ... input sequence into a number of (non-linguistic) phrases, translate each phrase using a phrase translation table, and allow for reordering of phrases in the output. No phrases may be dropped or ... noun phrases and prepositional phrases, which we will refer to as NP/PPs. We include prepositional phrases for a number of reasons. Both are attached at the clause level. Also, the translation of...

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

... Chickering, D. Geiger, and D. Heckerman. 1994. Learning bayesian networks: The combination of knowledge a nd statistical data. Technical Report MSR-TR-94-09, Microsoft Research. Y.J. Chu and T. H. Liu. ... the second-order MST has a score of m. Proof: First we observe that no tr ee can have a score greater than m since that would require more than m pairs of edges of t he form (x i , y j , z k ). ... consist- ing of pairs of a sentence x t and its correct depen- dency representation y t . The algorithm is an extension of the Margin In- fused Relaxed Algorithm (MIRA) (Crammer and Singer, 2003) to learning...

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

... Kallirroi Georgila, and James Henderson School of Informatics University of Edinburgh olemon@inf.ed.ac.uk Matthew Stuttle Dept. of Engineering University of Cambridge mns25@cam.ac.uk Abstract We demonstrate ... actions and in-car dialo gue actions, for each sub-task type of the in-car system. 121 An ISU Dialogue System Exhibiting Reinforcement Learning of Dialogue Policies: Generic Slot-filling in the TALK ... to exhibit rein- forcement learning of dialogue strategies, and also has a fragmentary clarification feature. This paper describes the main components and functionality of the system, as well as...

Ngày tải lên: 22/02/2014, 02: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

... difficulty of decision in the annotation of fine-grained semantic relations. 2 While the first gold standard dataset of verb pairs was annotated out of context, we constructed a second gold standard of ... understudied in the field of corpus-based learning of semantic relations. Machine learning methods have been previously applied to deter- mine semantic relations such as is-a and part -of, also succession, ... Classifiers in Ensemble Learning. Both token-based and type-based classification starts with determining of the most confident clas- sification for instances. Each instance of the cor- pus of unlabeled verb...

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

... im- provement in the efficacy of the SSS algorithm as described in Section 2. It is based on observing that the improvement in the goodness of fit by up to two consecutive splits of any of the current HMM states ... differ- ent learning setups are tabulated. We also see how as little as 5 minutes of speech is adequate for learning the acoustic units. 2 An Improved and Fast SSS Algorithm The improvement of the ... that the original application of SSS was for learning Figure 1: Modified four-way split of a state s. 2. For each HMM state s, compute the gain in log- likelihood (LL) of the speech by either a con- textual...

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

... improvement of 22- 38% in average precision over unstemmed text, and 93-96% of the performance of the state of the art, language specific stemmer above. We can speculate that, because of the statistical nature ... Proceedings of the 40th Annual Meeting of the As- sociation for Computational Linguistics (ACL), pages 255–262, July. John Goldsmith. 2001. Unsupervised learning of the morphology of a natural ... views, conclusions and findings in this paper are those of the authors and do not necessarily reflect the posi- tion of policy of the Government and no of cial en- dorsement should be inferred. References P....

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