Báo cáo khoa học: "A Grammar-driven Convolution Tree Kernel for Semantic Role Classification" doc

... convolution tree kernel, Mos- chitti (2004)’s PAF kernel, standard flat features with Linear kernels, and Poly kernel (d = 2). We can see that our hybrid convolution tree kernel out- performs the PAF kernel. ... hybrid convolution tree kernel is pro- posed in this paper to effectively model syntactic structures for semantic role la- beling (SRL). The hybrid kernel...

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

... paper presents a grammar-driven convolution tree kernel to solve the two problems 3 Grammar-driven Convolution Tree Kernel 3.1 Convolution Tree Kernel In convolution tree kernel (Collins ... used a convolution tree kernel (Collins and Duffy, 2001) for semantic role classification. The convolution tree kernel takes sub -tree as its feature an...

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

... Association for Computational Linguistics A Maximum Expected Utility Framework for Binary Sequence Labeling Martin Jansche ∗ jansche@acm.org Abstract We consider the problem of predictive infer- ence for ... al., 2006; Jansche, 2005). More specialized methods also exist, for ex- ample for support vector machines (Musicant et al., 2003) and for conditional random fields (Gross et al...

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

... a weight (0.25 for bi-grams containing weak letters; 0.5 for bi-grams containing potential non-weak letter affixes; 1 for all other bi-grams). Jaccard’s equation computes a SC for each pair of ... assess Adamson’s algorithm’s potential for clustering Arabic words, we preferred to compare instances of optimal performance. We varied the SC to yield, for each data set, the highest nu...

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

... Constituent-Context Model for Improved Grammar Induction Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA 94305-9040 {klein, manning}@cs.stanford.edu Abstract We ... B correspond to (unlabeled) trees in the obvious way. A bracketing is binary if it corresponds to a binary tree. Figure 2(b) is binary. We will induce trees by inducing tree- e...

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

... structural information in the gaps. Algorithm 1: Tree Sequence Pair Extraction Input: source tree and target tree Output: the set of tree sequence pairs Data structure: p[j 1 , j 2 ] to store tree ... structure as the upper tree and the expected target output with its syntac- tic structure as the lower tree. In the tree sequence alignment based model, in addition to the en...

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

... the tree to obtain a set of subtrees. The reason for keeping a hierarchy instead of a fixed partition of the vocabulary is to be able to dynamically adjust the partition to accommodate for ... these simple models perform surpris- ingly well, there is much room for improvement. The approach used in this paper is to classify the histories by means of a decision tree: to clus- te...

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

... There- fore, these results clearly indicate that the electron transport system for CYP175A1 is composed of Fdx, FNR, and NADPH (Fig. 4B). All quantitative analyses were performed at 65 °C for 2 ... via OFOR and Fdx to CYP119 [13,14]. Inter- estingly, the electron transport system for CYP175A1 did not utilize OFOR, although the T. thermophilus HB27 genome contains the genes encoding OFOR...

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

... of the Association for Computational Linguistics, pages 180–189, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics A New Dataset and Method for Automatically ... analyses of the perfor- 180 mance of individual systems, as yet there is no pub- lically available shared dataset for training and test- ing such systems and comparing their performance. As...

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

... neighboring source phrases and τ(T, s) (τ(s) for short) is a subtree function which returns the minimal subtree covering the source sequence s from the source parse tree T . Note that τ (c i k ) includes ... then 8: Update bracketing instances for index j 9: end if 10: end if 11: end for 12: for each j ∈ c do 13:  :=  ∪ {bracketing instances from j} 14: end for 15: Output: brack...

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