Báo cáo khoa học: "Mildly Context-Sensitive Dependency Languages" potx

... Dependency Grammar These factors are exactly the same that make depen- dency parsing for free word order languages diffi- cult, and it seems worthwhile to see whether op- timized parsers for dependency ... can be translated back to cor- rect dependency trees. But for efficiency, the parser uses additional propagators tailored to the specific inferences of the dependency problem. For inst...

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

... Japan {dk, uchimoto}@nict.go.jp Abstract Dependency structures do not have the infor- mation of phrase categories in phrase struc- ture grammar. Thus, dependency parsing relies heavily on the ... lexicalization in dependency parsing. Specifically, by re- stricting the degree of lexicalization in the training phase of a parser, we examine the change in the accuracy of dependency re- lat...

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

... genera- tive capacity of regular dependency languages, link- ing them to a large class of mildly context-sensitive grammar formalisms. 5.1 Gap-restricted dependency languages A dependency language L is ... Regular dependency grammars We call a dependency language regular, if its encod- ing as a set of trees over ˙  ˝ forms a regular tree language, and write REGD for the class of...

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

... representational adequacy with respect to two dependency treebanks: the Prague Dependency Treebank (PDT) (Haji ˇ c et al., 2001), and the Danish Dependency Treebank (DDT) (Kromann, 2003). The ... projection of i: the yield of i, arranged in ascending order. 2.1 Dependency forests Most of the literature on dependency grammar and dependency parsing does not allow arbitrary de- pende...

Ngày tải lên: 08/03/2014, 02:21

... data-driven dependency parsing is the treatment of discontinuous syntactic constructions, usually modeled by non-projective dependency trees, as illustrated in Figure 1. In a projective dependency ... Section 5 and conclude in Section 6. 2 Background Notions 2.1 Dependency Graphs and Trees Given a set L of dependency labels, a dependency graph for a sentence x = w 1 , . . . , w n...

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

... the space of non-projective dependency trees, which is considerably larger than the space of projective dependency trees, would yield poor performance. That is not the case: dependency accuracy for ... non-projective dependency parsing, we need to maintain additional information for each word x j of the partial translation x: • a predicted POS tag t j ; • a dependency score s j . D...

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

... opens the possibility of using different dependency patterns for different token types. Formal definition An order-n FlexGram model is specified by a tuple of dependency offsets [d 1 , d 2 , . . . ... FlexGram model We perform a search over the space of dependency offsets using the split+0 dataset and considered n- gram orders 2 to 6 and picked the dependency off- sets within a window o...

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

... Lopez and Resnik (2005) extended the HMM model by integrating a tree distortion model based on a dependency parser built on the English side of the parallel corpus. The latter two methods produced ... above three methods use some language dependent resources such as dictionary, thesaurus, and dependency parser. And some methods, such as transliteration similarity, can only be used...

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

... the finite-state dependency parser for Turkish by Oflazer (2003). This is in contrast to dependency treebanks, e.g. Prague Dependency Treebank (Haji ˇ c et al., 2001b), Danish Dependency Treebank ... ☎ Adv Z: . .) ✞ ☎ ❄ AuxZ Figure 1: Dependency graph for Czech sentence from the Prague Dependency Treebank 1 There exist a few robust broad-coverage parsers that produce non-projective...

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

... advantage of a dependency tree is that it can explore the long distance dependency. 1434 1: talk blank a blan blan 2: held Bush bla blk talk a bl with b Sharon We use the lexicon dependency grammar ... third, through the kth best alter- natives. 4.1 Dependency Language Model Computing We compute the score of a dependency language model for a dependency tree D e in the same way pro...

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