Báo cáo khoa học: "Another Facet of LIG Parsing" potx

... formalism, from a computational point of view, many authors think that LIGs play a central role and therefore the un- derstanding of LIGs and LIG parsing is of impor- tance. For example, quoted ... parentheses remind us that we are in a LIG! The CF-backbone of a LIG is the underlying CFG in which each production is a LIG production where the stack part of each constit...

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

... Elements: Categorization Cognizer Item Category Criterion S NP PRP VP VBD NP SBAR IN S NNP VP VBD NP PP PRP IN NP NN Goal Source Theme Target NP He heard the sound of liquid slurping in a metal container as approached him from behindFarrell

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

... languages. Instead of assuming this correspondence, we penal- ize for the lack of isomorphism between the sets of roles in aligned predicates with the penalty depen- dent on the degree of violation. This softer ... proportion of times the role r (l  ) of predicate p (l  ) in language l  is aligned to the role r (l) of predicate p (l) in language l, and f r (l) is the total nu...

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

... state of the art We directly compare our filters to those of Bergsma and Cherry (2010) in terms of both intrinsic fil- ter quality and impact on the MST parser. The B&C system consists of three ... effect. The performance of Joint-P2+MST-2 is compa- rable to the system of Huang and Sagae (2010), who report a parsing speed of 25 sentences per second and an accuracy of 92.1 on...

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

... ancestor of the foot node of a. and hence, the ancestor of the foot node of any derived tree "r in D(a). Let Y be the label of the root and foot nodes of (~. If the frontier of 7 ('T ... • descund mt* of node else =1 •uch t*h&t* the 1 ~ child of •ode is ancan~r of foot* node,J=uQber of chiZdreu of •ode for Im-I co J sup I do Convert, to HG(k ~ c...

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

... set of possi- ble S-trees and F~ is a collection of relations of type T m × T, m > 0. F~ contains all relations defined by the M-rules of subgrammar i. s The set of production rules of ... part of the translation system an S-tree of the source language is mapped onto a set of semantic derivation trees. Next, each semantic derivation tree is mapped onto a set of...

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

... ligence, pages 1304-1310, 1989. [Schegloff and Sacks, 1973] Emanuel A. Schegloff and Harvey Sacks. Opening up closings. Semi- otica, 7:289-327, 1973. [Schegloff, 1992] Emanuel A. Schegloff. ... repairs on the basis of the relatively few types of manifestations of mis- understanding, rather than the much broader (and hence more difficult to anticipate) range of sources. In this...

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

... finite set of non-terminal symbols, VT a finite set of terminal symbols, S the axiom of the grammar, I a finite set of initial trees and A a finite set of auxiliary trees. IUA is the set of elementary ... in charge of the recog- nition of adjunctions. The other steps are in charge of the bottom-up traversal of elementary trees and, in the case of auxiliary trees,...

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

... ad- ditional amount of storage that is O(n): for j - i + 1 values of k we have to perform the construction of a pair of (copies of) two references, costing a unit amount of storage each. Therefore, ... proportional to the number of parsing procedures. The number of procedures of the recursive descent parser is proportional to the number of items, and hence a linear fun...

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

... word of t i is a dependent of a word of t j ; (2) a word of t j is a dependent of a word of t i ; or (3) the two trees are not related. The formulations of these transitions in the lower block of ... = (W, A). The set of nodes W = {w 0 , w 1 , . . . , w n } corresponds to the words of a sentence, and the node w 0 is the root of G. A is the set of arcs (w i , w j ), eac...

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