Báo cáo khoa học: "SOME CHART-BASED TECHNIQUES FOR PARSING ILL-FORMED INPUT" potx

... beliebiger Impulsform ergibt sich das Faltungsprodukt aus Membran- und Impulsform. (1) By any form of the impulse yields -self the products of the folding out membrane- and form of the impulse. ... any form of the impulse yields the products of the folding out membrane- and form of an impulse. (3) By any form of the impulse yields the products of the folding out membrane- and for...

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

... accounts for the f  1 gaps in the body of g .) Example 4 The set of positions of the production for hearing in Figure 2 is Œ4 : 1 for variable x 1 , 2 for hearing, 3 for the gap, and 4 for y 1 .  Let i 1 ; ... above. 3.4 Parsing the Extracted Grammar Once we have extracted the grammar for a depend- ency treebank, we can apply any parsing algorithm for LCFRS to non-proje...

Ngày tải lên: 31/03/2014, 20: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

... algorithm for pro- jective dependency parsing. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pages 149–160. Eric W. Noreen. 1989. Computer-intensive methods for testing ... Association for Computational Linguistics, pages 675–684, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Exploiting Multiple Treeban...

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

... and points on either side). See Dickinson and Meur- ers (2003b) for details. This work forms the basis for the DECCA system. 1 2.2 Motivation for Our Approach (2) a. NP qmp summit NP $rm Sharm NP Al$yx the ... 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...

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

... that the use of probability information from the parser for tree conversion helps target grammar parsing. 4.3 Using Unlabeled Data for Parsing Recent studies on parsing indicate that the use ... Parsing Through grammar formalism conversion, we have successfully turned the problem of using hetero- geneous treebanks for parsing into the problem of parsing on homogeneous treeba...

Ngày tải lên: 17/03/2014, 01: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 ... still doesn't make SRNs adequate for syntactic parsing. Because SRNs have a bounded number of output units, and therefore an effectively bounded output for each in- p...

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

... dual parameters For For If Then If Then Output on test sentence : Output on test sentence : . Figure 1: a) The perceptron algorithm for ranking problems. b) The algorithm in dual form. this translates ... top candi- dates from a baseline probabilistic model: the model of (Collins 1999) for parsing, and a maximum- entropy tagger for named-entity recognition. 2 i.e., polynomial in the...

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