Báo cáo khoa học: "Character-based Kernels for Novelistic Plot Structure" pptx

... Association for Computational Linguistics, pages 634–644, Avignon, France, April 23 - 27 2012. c 2012 Association for Computational Linguistics Character-based Kernels for Novelistic Plot Structure Micha ... computational meth- ods for summarizing and generating sto- ries. Current representations lack abstrac- tion, focusing too closely on events. We present a kernel for comp...

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

... kernel for phrase grammar parse trees and for depen- dency parse trees outperforms all known tree kernel approaches alone suggesting that both types of trees contain comple- mentary information for ... (2003) and Culotta and Sorensen (2004) proposed kernels for dependency trees (DTs) inspired by string kernels. Zhang et al. (2006) suggested a kernel for phrase grammar parse trees...

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

... the properties of kernels, we have de- fined independently a set of domain and syntagmatic kernels and we combined them in order to define a complete kernel for WSD. The domain kernels esti- mate ... combination of n basic kernels. Each kernel adds some addi- tional dimensions to the feature space. In particular, we have defined two families of kernels: Domain and Syntagmatic kernels....

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

... interface for Information Retrieval. Proceedings of the 6th Annual International ACM SIGIR Conference, ACM Special Interest Group on Information Retrieval and American Society for Infor- mation ... word gets transmitted and no pattern for it exists in a base IRule for the head word, higher IRules are searched for the pattern. If a pattern does exist for the modifier in a gi...

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

... map- ping. Therefore, we obtained new results for these methods in our setup. For the Transfer baseline, for each target language we trained the model on all other languages in our dataset. For the Mixture baseline, ... im- pact the final performance. As a selection criterion for initialization, we consider the performance of the final model averaged over the supervised source lan- gu...

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

... to minimize some information loss such as the KL divergence KL(p  q). The simpler model q can then act as a surrogate for p during inference. 3.2 Variational Decoding for MT For each input sentence ... q ∗ (· | h) constrained to be a normalized distribution for each h. 596 Brute-Force-MLE(HG(x )) 1 for y, d in HG(x) ✄ each derivation 2 for w in y ✄ each n-gram type 3 ✄ accumulate...

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

... word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the op- timal layout of a single tree as well as a numerical method for optimizing ... weights by assign- ing, for each dependency relation in the corpus, an integer according to its position relative to the head, -1 for the first dependent to the left, -2 for t...

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

... appointment scheduling domain is there- fore ideal for a case study aimed at extracting linguistic indicators for definiteness. 3.1 Overview Explicit marking for definiteness takes place on several ... target language. For this paper, we propose a rule hierarchy for this purpose, that can be used as a pre- processing tool to context checking. All noun phrases marked for de...

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

... for each tar- get relation, an integrated model to weight the dif- ferent extraction options, including for example the likely lengths for events, or the fact that start times should come before ... features. In addition, we enforce label consistency and semantic coherence at record level. Other related works perform structured relation discovery for different settings of information...

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

... Tie-Yan Liu, Jun Xu, and Hang Li. 2010. Letor: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4):346–374. S. Shalev-Shwartz, Y. Singer, ... both query and document in- formation, a probabilistic weighting for ⟨x i , x j ⟩ was modeled by w q ∗ w ij . Through the transformation, instance weighting schemes for classification ca...

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