Báo cáo khoa học: "Judging Grammaticality with Tree Substitution Grammar Derivations" pptx

... from a Treebank with a Bayesian model, their usefulness here suggests a greater potential for adapting to other languages and datasets. 2 Tree substitution grammars Tree substitution grammars ... data) 2. A Treebank grammar (Charniak, 1996) 3. A Bayesian-learned tree substitution grammar (Post and Gildea, 2009a) 2 2 The sampler was run with the default settings for 1,000 i...

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

... referring to initial trees and auxiliary trees. A TAG derives trees by a sequence of substitutions and adjunctions in the elementary trees. In substitution an instance of an initial tree in which ... derivation trees for G is exactly T(G'). Proof: This is nearly immediate, since every CFG is equivalent to a Tree Substitution Grammar (in which all trees are of depth on...

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

... associating each node with one of the three atomic values ass, rec or 0. These values represent the Case properties of the node they are associated with; a node associated with the property ... Case assigner, a node associated with the property rec must be capable of being assigned Case, and a node associated with the property 0 must be neutral with respect to Case. The Cas...

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

... emails with 72 authors (Argamon and Juola, 2011); and (2) Blog: blogs with 19,320 authors (Schler et al., 2006). These datasets represent realistic scenar- ios of AA of user-generated texts with ... latter ap- proach performs poorly in cases with many candi- date authors. Hence, we use only the former ap- proach in this paper. Note that when dealing with single-authored texts, conca...

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

... to the larger model with p cues plus an intercept, and SSRR refers to the reduced model with (p - q) cues and an intercept(Jobson, 1991). The stepwise method begins with a model that contains ... comparing the performance among the case with- out lexical chains("ex.l"), the one only with lexical chains("ex.2"), and the one with multiple linguis- tic cue...

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

... an optimal spanning tree, this does 852 not always correspond with a linguistically valid dependency tree, primarily because it does not at- tempt to ensure that words in the tree have plausi- ble ... edges corresponding to a tree with maximum probability such that each vertex in the graph is visited once, thus including each word once. The resulting tree is a spanning tree, an a...

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

... pair, (b) a tree transformation based mapping, and (c) a tree trans- ducer that performs the mapping. volve tree transformations either between two trees or a tree and a string. The tree transducer, ... language. A regular tree grammar (RTG) closely resembles a context free grammar (CFG), and is a way of de- scribing a language of trees. Formally, define T Σ as the set of trees...

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

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

... most 1 foot-node, such a tree is an auxiliary tree. Trees that are not auxiliary are initial. Elementary trees combine with 2 operations : substitution and adjunetion. Substitution is compulsory ... derivation trees : 1. Prefer the derivation tree with the fewer number of nodes 2. Prefer to attach an m -tree low 6 3. Prefer the derivation tree with the fewer number of...

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

... This paper discusses a decision -tree approach to the problem of assigning probabilities to words following a given text. In contrast with previ- ous decision -tree language model attempts, an ... discussed below. Once the tree has been grown, we address one other issue: the estimation of the language model at each leaf of the resulting tree classifier. 2.1.1 The Tree Growi...

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