0

bayesian learning of noncompositional phrases

Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Semantic Classification of Noun Phrases Using Web Counts and Learning Algorithms" ppt

Báo cáo khoa học

... 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...
  • 6
  • 622
  • 2
A study on some major factors affecting English learning of grade 6 ethnic minority students of a mountainous secondary school to help them learn better

A study on some major factors affecting English learning of grade 6 ethnic minority students of a mountainous secondary school to help them learn better

Thạc sĩ - Cao học

... 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...
  • 39
  • 1,502
  • 6
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Semi-supervised Learning of Dependency Parsers using Generalized Expectation Criteria" ppt

Báo cáo khoa học

... x.By relating the sum of the scores of all possibletrees to counting the number of spanning trees in agraph, it can be shown that Zxis the determinant of the Kirchoff matrix K, which is ... marginalprobability of a particular edge k → i (i.e. yi=k),the score of any edge k→ i such that k= k isset to 0. The determinant of the resulting modi-fied Kirchoff matrix Kk→iis then the sum of ... basictypes of linguistic knowledge.One simple form of linguistic knowledge is theset of possible parent tags for a given child tag.This type of constraint was used in the devel-opment of a rule-based...
  • 9
  • 403
  • 1
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Generalized Expectation Criteria for Semi-Supervised Learning of Conditional Random Fields" pdf

Báo cáo khoa học

... tractableamount of time, since according to the Markov as-2Often these are more complicated than picking informativefeatures as proposed in this paper. One example of the kind of operator used ... Semi-Supervised Learning of Conditional Random FieldsGideon S. MannGoogle Inc.76 Ninth AvenueNew York, NY 10011Andrew McCallumDepartment of Computer ScienceUniversity of Massachusetts140 ... addition of lower cost unlabeled data. Tradi-tional approaches to semi-supervised learning areapplied to cases in which there is a small amount of fully labeled data and a much larger amount of un-labeled...
  • 9
  • 492
  • 1
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Automatic learning of textual entailments with cross-pair similarities" ppt

Báo cáo khoa học

... ex-amples of the previous section. From the point of view of bag -of- word methods, the pairs (T1, H1)and (T1, H2) have both the same intra-pair simi-larity since the sentences of T1and ... Areasonablysmall.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. Theexample of Fig. 1 shows that the placeholder0climbs up to the node governing all the NPs.5.3 Pruning irrelevant information in largetext treesOften only a portion of...
  • 8
  • 413
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Semi-Supervised Learning of Partial Cognates using Bilingual Bootstrapping" doc

Báo cáo khoa học

... 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...
  • 8
  • 418
  • 1
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Feature-Rich Statistical Translation of Noun Phrases" ppt

Báo cáo khoa học

... translation of noun phrases. They constitute soft constraints that may be over-ruled by other components of the system.5 ResultsAs described in Section 3.1, we evaluate the per-formance of our ... input sequence into a number of (non-linguistic) phrases, translate each phrase usinga phrase translation table, and allow for reordering of phrases in the output. No phrases may be droppedor ... noun phrases andprepositional phrases, which we will refer to asNP/PPs. We include prepositional phrases for anumber of reasons. Both are attached at the clauselevel. Also, the translation of...
  • 8
  • 483
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Online Learning of Approximate Dependency Parsing Algorithms" potx

Báo cáo khoa học

... Chickering, D. Geiger, and D. Heckerman. 1994. Learning bayesian networks: The combination of knowledge a nd statistical data. Technical ReportMSR-TR-94-09, Microsoft Research.Y.J. Chu and T. H. Liu. ... the second-orderMST has a score of m. Proof: First we observe that no tr eecan have a score greater than m since that would require morethan m pairs of edges of t he form (xi, yj, zk). ... consist-ing of pairs of a sentence xtand its correct depen-dency representation yt.The algorithm is an extension of the Margin In-fused Relaxed Algorithm (MIRA) (Crammer andSinger, 2003) to learning...
  • 8
  • 415
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "An ISU Dialogue System Exhibiting Reinforcement Learning of Dialogue Policies: Generic Slot-filling in the TALK In-car System" pot

Báo cáo khoa học

... Kallirroi Georgila, and James HendersonSchool of InformaticsUniversity of Edinburgholemon@inf.ed.ac.ukMatthew StuttleDept. of EngineeringUniversity of Cambridgemns25@cam.ac.ukAbstractWe demonstrate ... actionsand in-car dialo gue actions, for each sub-task type of the in-car system.121An ISU Dialogue System Exhibiting Reinforcement Learning of DialoguePolicies: Generic Slot-filling in the TALK ... to exhibit rein-forcement learning of dialogue strategies, andalso has a fragmentary clarification feature.This paper describes the main components andfunctionality of the system, as well as...
  • 4
  • 394
  • 0
Unsupervised Learning of Narrative Event Chains docx

Unsupervised Learning of Narrative Event Chains docx

Tổ chức sự kiện

... candidates. Of the 740 cloze tests, 714 of theremoved events were present in their respective list of guesses. This is encouraging as only 3.5% of theevents are unseen (or do not meet cutoff thresholds).When ... thus a tuple of the event and thetyped dependency of the protagonist: (event, depen-dency). A narrative chain is a set of narrative events{e1, e2, , en}, where n is the size of the chain, ... specifically on learning narratives1, 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...
  • 9
  • 396
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Weakly Supervised Learning of Presupposition Relations between Verbs" pptx

Báo cáo khoa học

... difficulty of decision in the annotation of fine-grained semantic relations.2While the first gold standard dataset of verbpairs was annotated out of context, we constructeda 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 classificationstarts with determining of the most confident clas-sification for instances. Each instance of the cor-pus of unlabeled verb...
  • 6
  • 415
  • 1
Báo cáo khoa học:

Báo cáo khoa học: "Unsupervised Learning of Acoustic Sub-word Units" pot

Báo cáo khoa học

... im-provement in the efficacy of the SSS algorithm asdescribed in Section 2. It is based on observingthat the improvement in the goodness of fit by upto two consecutive splits of any of the current HMMstates ... differ-ent learning setups are tabulated. We also see how aslittle as 5 minutes of speech is adequate for learning the acoustic units.2 An Improved and Fast SSS AlgorithmThe 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...
  • 4
  • 295
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Unsupervised Learning of Arabic Stemming using a Parallel Corpus" pot

Báo cáo khoa học

... improvement of 22-38% in average precision over unstemmed text, and93-96% of the performance of the state of the art,language specific stemmer above.We can speculate that, because of the statisticalnature ... Proceedings of the 40th Annual Meeting of the As-sociation for Computational Linguistics (ACL), pages255–262, July.John Goldsmith. 2001. Unsupervised learning of themorphology 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.ReferencesP....
  • 8
  • 424
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Don’t ‘have a clue’? Unsupervised co-learning of downward-entailing operators" pptx

Báo cáo khoa học

... corpus.Then, our co -learning algorithm consists of theiteration of the following two steps:• (DE learning) Apply DLD09 using a set N of pseudo-NPIs to retrieve a list of candidateDE operators ... consequence of the very small size of the NPIlist employed, and may therefore indicate that itwould be fruitful to investigate automatically ex-tending our list of clues.3.4 Main idea: a co -learning ... right of a DE operator, up to the first comma,semi-colon or end of sentence); these candidates xare then ranked byfr(x) :=fraction of DE contexts that contain xrelative frequency of x in...
  • 6
  • 370
  • 0

Xem thêm