Tài liệu Báo cáo khoa học: "Composing extended top-down tree transducers" pdf

... contribution is an extension of the classical top-down tree trans- ducer, which was introduced by Rounds (1970) and Thatcher (1970). The extended top-down tree transducer with finite look-ahead or ... an extended top-down tree transducer that is no longer linear or nondeleting, but in a number of cases these properties can easily be recov- ered by a post-processing step. 1 Intr...

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

... .L) is equivalent to _L, and so inconsistent. Now we define a logical extended feature structure (LoXF) to be an extended feature structure iN, K:) in which K: = Mod(¢) for some consistent ... we represent, in part, a set of llorn feature clauses with an extended feature graph. Shown in Figure I below is the initial extended feature graph for the set ~, representing the stat...

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

... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa ... LR method. This paper is an attempt to incorporate feature-based categories into Tomita's extended LR parsing algorithm (Tomita 1986). A straightforwmd adaptation of feature- based categories ... lookahead. Parse u'ees for input strings are built bottom-up, while...

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

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

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

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

... that we do not guarantee that the resulting tree is projective. In fact, our trees are more likely to be non-projective than syntactic dependency trees of English sentences, because in our representation many ... dependency trees and con- verted gold dependency trees. LAS is approximate for two reasons. First, it is much more local than the BioNLP metric. 9 Second, the converted gold de- pe...

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

... examples. 365 2.1 Parse Trees A sentence can be processed by a parser to gener- ate a parse tree, which can be further categorized in phrase grammar parse trees (PTs) and depen- dency parse trees (DTs). ... Path-enclosed PT Tree Kernel (Zhang et al., 2008) operates on PTs. It is based on the Convolu- tion Tree Kernel of Collins and Duffy (2001). The Path-enclosed Tree is the parse tre...

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

... argument. Given a tree portion instance defined above, we design a convolution tree kernel in a way similar to the parse tree kernel (Collins and Duffy, 2001). Firstly, a parse tree T can be represented ... vec- tor of integer counts of each sub -tree type (regard- less of its ancestors): Φ(T ) = (# of sub-trees of type 1, . . . , # of sub-trees of type i, . . . , # of sub-trees of ty...

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

... great grand-parent). Edge POS-tag to the left and right of the subtree, both inside and outside the subtree. For exam- ple, say a subtree with parent POS-tag p–pos spans from i to j, we include composite ... the k-best parse trees for a constituency- based parser was presented in Huang and Chiang (2005); a variation of that algorithm was used for generating projective dependency trees for par...

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