Báo cáo khoa học: "Unlexicalised Hidden Variable Models of Split Dependency Grammars∗" pdf

... second-order grammars with hidden variables. 3 Hidden Variable Models Because they do not stipulate the existence of phrasal nodes, commonly used unlabelled depen- dency models are not sufficiently ... distinct projections of a head, we annotate each of the symbols that refers to it with a unique hidden variable. We thus constrain the dis- tribution of the possible values...

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

... they delay the evalua- tion of the probabilities of the same words and if they have the same number of lexical heads, and if the first two elements of their lists of lexical heads are identical ... (Hockenmaier and Steedman, 2002b), include models of bilexical dependencies defined in terms of local trees. However, this paper demonstrates that such models would be inadequate fo...

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

... Vector-based models of seman- tic composition. In Proceedings of ACL-08: HLT, pages 236–244. ACL. [Padó and Lapata2007] Sebastian Padó and Mirella La- pata. 2007. Dependency- based construction of se- mantic ... a vector v of numerical values; one might, e.g., think of the level of excitation of neurons. Then, an external stimulus or signal, such as a perceived word, will res...

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

... problem solving from a record of the problem solving report and a record of moves made. Then, we use this extracted trace to evaluate our model of the role of point of view in problem solving. ... study of problem solving action and report: I) the collected of data on problem solving and talk about problem solving, 2) development of a process model of these behaviors,...

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

... maintainability of the syst~. A~ noted in the previous section the application of the rules of section 4 will not be discussed in this paper. The r~nainder of the paper discusses the use ~.%~de of ... Tra,,slation frr, n Dependency Structures to Surface Syntactic Trees The pranary work of conversion frQm the dependency representations to the surface syntactic trees is...

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

... form — a form of a noun or an adjective, in- cluding adjectival forms of past participles –, to- gether with a bundle of inflectional feature values — values of inflectional features of Gender and Number ... reverse proce- dure of conjugation of the output and matching with the original input. These rules are supple- mented by a list of overriding exceptions. It thus handles an...

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

... Product models or Prod- uct of Experts (Hinton, 1999), the probability of the ensemble model or a rule is computed as the product of the probabilities of all compo- nents (or equally the sum of log-probabilities, i.e. ... consists of those of multi- ple systems, in that model combination uses forest of derivations of all component models to do the combination. In other w...

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

... word sequence models as language models. Modern phrase-based translation using large scale n-gram language models generally performs well in terms of lexical choice, but still often produces ungrammatical ... essentially an extension of an HHMM, which obtains a most likely sequence of hidden store states, ˆs 1 D 1 T , of some length T and some maxi- mum depth D, given a sequen...

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

... 2003). Phrase-based models have proved to be very ad- equate statistical models for MT (Tom ´ as et al., 2005). In this work, the use of these models has been extended to interactive CAT. The organization of ... real-time is re- quired. 4 Phrase-based models The usual statistical translation models can be classified as single-word based alignment models. Models of this kind...

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

... used as a cut-off for the number of occurrences that a spe- cific feature must appear. So a cut-off of 0 means that all features observed in the training data are used. A cut-off of 32 means those ... alignment models , the alignment is introduced as a hidden variable. Typically, the search is performed using the so- called maximum approximation: The search space consists of the...

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