Báo cáo khoa học: "A Study on Convolution Kernels for Shallow Semantic Parsing" pdf

... F z ) = (c+x·z) d , where c is a constant and d is the degree of the polynom. 3 Convolution Kernels for Semantic Parsing We propose two different convolution kernels associated with two different ... common characteris- tic is the adoption of feature spaces that model predicate-argument structures in a flat repre- sentation. On the contrary, convolution kernels aim to capture...

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

... distribution of LIRs in both intronic and intergenic regions (see Fig. S1). We also considered the effect of the length of these regions on the distribution. The intronic and intergenic regions were ... results confirmed that LIRs tend to reside in large intronic and intergenic regions. Only five LIRs were found in introns < 1 kb (the smallest intron was 757 bp), and none in intergenic reg...

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

... International Conference on Computational Linguistics and 44th Annual Meeting of the ACL, pages 537–544, Sydney, July 2006. c 2006 Association for Computational Linguistics A Study on Automatically ... representation by selecting one or the other for each category. They show that concept-based representations can outperform traditional word-based representations, and that a combina...

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

... annotate parent informa- tion onto the constituents, as Johnson did in (John- son, 1998), this richer predictive annotation can ex- tend information slightly beyond the left context. Under the ... (Charniak, 2001). For these reasons, we prefer enriching the syntactic dependencies by information from the left context. However, as mentioned in (Roark, 2001), one way of conditioning the probab...

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

... characteristic relation. 2. Canonical graphs. Canonical graphs express the semantic constraints (or semantic expectations ruling the use of a concept. For example, the canonical graph for GO is: ... sections discuss the above listed items. Concepts, relations and words. The pr()htem analyzed in this section concerns the translation of a words dictionary into a concept-relatio...

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

... Results show that accounting for multiple derivations does in- deed improve performance. Additionally, we show that regularisation is essential for max- imum conditional likelihood models in order to ... derivations. As the training data only provides source and target sentences, the derivations are modelled as a latent variable. The conditional probability of a derivation, d, for a tar...

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

... (TyR for type recall, ToR for token re- call): what proportion of the analyses in the gold standard does MAGEAD get? Precision (TyP for type precision, ToP for to- ken precision): what proportion ... rules rewrite only the ortho- graphic representation. These include, for exam- ples, rules for using the shadda (consonant dou- bling diacritic). For MSA, we have 53 such rules. Fo...

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

... Gl*c-e, on the other hand, is unmotivated if the only criteria for choosing an affix type have to do with direction of recursion. For affix grammars of natural languages, however, one can ... descriptions of those ex- pressions. This paper considers some initial steps in the construction of such a model. The first step is to determine a method of represen- ting the class of const...

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

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

... normalization. Notation Normalization n (none) 1 c (cosine) 1 √ w 2 1 +w 2 2 + +w 2 n Significant research has been done in IR on di- verse weighting functions and not all versions of SMART notations are consistent ... a∆(p)c vs. a∆ (p ′ )n. 6 Conclusions In this paper, we presented a study of document representations for sentiment analysis using term weighting functions adopted from inf...

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