Báo cáo khoa học: "Generalizing Tree Transformations for Inductive Dependency Parsing" potx

... MS. 2.3 Transformations, Parsers, and Treebanks Pseudo-projective parsing and transformations for coordination and verb groups are instances of the same general methodology: 1. Apply a tree transformation ... 968–975, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Generalizing Tree Transformations for Inductive Dependency Parsing Jens N...

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

... conclusions in section 6. 2 Inductive Dependency Parsing The system we use for the experiments uses no grammar but relies completely on inductive learn- ing from treebank data. The methodology ... ☎ ❄ NMOD NN markets ✞ ☎ ❄ PMOD . . ❄ ✞ ☎ P Figure 1: Dependency graph for an English sentence from the WSJ section of the Penn Treebank require non-projective dependency arcs. For th...

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

... of Penn Treebank into training (sections 2-21), devel- opment (section 22) and test (section 23). We used the ‘pennconverter’ 5 tool to convert Penn trees from constituent format to dependency format. ... error reduction. Results are for dependency parsing on the dev set for iters:5,training-k:1. tal errors break down by gold head. For example, the 12.1% total error reduction for...

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

... into discussion of the under- lying complexity, for which we unfortunately do not have space here, we give an exter- nal form of a lexical entry for some of the senses of the German verb traeumen. ... PATR-style languages is their lack of facilities for defining new abstractions and expressing linguistic generalisations not foreseen (or even foreseeable) by the language desi...

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

... compo- nent describing their functional structure. For the rule for S, for instance, we add an ele- ment describing what the SUBJECT and PRED are for. We could say that the SUBJECT is the theme ... complete formal paraphrase of (1) must include at least as much information as we have given above. In particular, the logical structure of our para- phrases contains essential inform...

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

... Sheikh NP #a3 qmp summit #b1 S:1.2 NP NP^ $rm Sharm #b2 NP Al$yx The Sheikh For (2a) For (2b) For (2c) A:1.1,left #b3 NP Al$yx The Sheikh A:1.1,left #c3 $rm Sharm Figure 1: Etrees and Derivation Trees for (2abc). tree- substitution, sister-adjunction, ... “building blocks” of the full trees of a treebank. This decomposition of the full tree into etrees also results in a “derivati...

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

... arguments are lo- cal in the dependency tree; that is, one lexical item can be a semantic argument of another one only if they are connected by an arc in the dependency tree. This is a slight simplification ... syntactic realizations for each semantic class and distributions of syntactic dependency arcs for argument types. In this section we present relevant background on PY proce...

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

... Response times for distantly related pairs was faster than for homo- nyms (distantly related mean: 1253ms, homonym mean: 1406ms; t 32 =2.38; p<.0001). Accuracy was en- hanced as well for this ... implications for automatic word sense disam- biguation. 1 Introduction * The problem of creating a successful word sense disambiguation system begins, or should begin, well before...

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

... computed. However the link weights that perform this computation are the same for all the positions in the sequence. Therefore the infor- mation that was learned for an input and context in one sequence ... pattern for the gestalt inputs is straightforward, since these inputs per- tain to information about the sentence as a whole. Whenever a tag is input to the network, the activ...

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

... according to these search meth- ods was used for freq(X P). The freq(X) was de- rived from the WWW by performing a separate search for the single word form. Method I: cooccurrence NnearP or VnearP Volk ... al- gorithm for Dutch (van Herwijnen and Terken, 2001b). This phrasing algorithm uses syntactic in- formation and sentence length for the allocation of prosodic phrase boundarie...

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