Titlebook: Dependency Structures and Lexicalized Grammars; An Algebraic Approac Marco Kuhlmann Book 2010 Springer-Verlag Berlin Heidelberg 2010 comput

不正常

書目名稱Dependency Structures and Lexicalized Grammars影響因子(影響力)




書目名稱Dependency Structures and Lexicalized Grammars影響因子(影響力)學科排名




書目名稱Dependency Structures and Lexicalized Grammars網(wǎng)絡(luò)公開度




書目名稱Dependency Structures and Lexicalized Grammars網(wǎng)絡(luò)公開度學科排名




書目名稱Dependency Structures and Lexicalized Grammars被引頻次




書目名稱Dependency Structures and Lexicalized Grammars被引頻次學科排名




書目名稱Dependency Structures and Lexicalized Grammars年度引用




書目名稱Dependency Structures and Lexicalized Grammars年度引用學科排名




書目名稱Dependency Structures and Lexicalized Grammars讀者反饋




書目名稱Dependency Structures and Lexicalized Grammars讀者反饋學科排名

紡織品

Maria Spadafora,Mario Rapaccini,Shaun Westroperly decreases expressiveness on nearly all levels of this hierarchy (Section 8.2). Finally, we discuss the complexity of the parsing problem of the string languages generated by regular dependency grammars. In particular, we show that the well-nestedness condition can make the change between tractable and intractable parsing (Section 8.3).

加劇

Preliminaries, theory [17]. To describe and manipulate structures and sets of structures, we make use of terms and term languages, and of the usual operations defined on them [28]. Note that we use the word ‘term’ for the syntactic object, and the word ‘tree’ when referring to the order-theoretic and graph-theoretic structures.

FLAG

Generative Capacity and Parsing Complexity,roperly decreases expressiveness on nearly all levels of this hierarchy (Section 8.2). Finally, we discuss the complexity of the parsing problem of the string languages generated by regular dependency grammars. In particular, we show that the well-nestedness condition can make the change between tractable and intractable parsing (Section 8.3).

Exclude

Projective Dependency Structures,ent algorithm to test whether a given dependency structure is projective (Section 3.3). We use this algorithm to evaluate the practical relevance of projectivity on data from three dependency treebanks (Section 3.4).

偽造

偽造

話

Regular Dependency Languages,utomata and grammars for this class of languages (Section 7.1).We then develop a powerful pumping lemma for regular dependency languages (Section 7.2) and apply it to show that the languages in this class are of constant growth, a property characteristic for mildly context-sensitive languages (Section 7.3).

詩集

Book 2010e PhD thesis of Marco Kuhlmann, joint winner of the E.W. Beth dissertation award in 2008.Kuhlmann’s thesis lays new theoretical foundations for the study of non-projective dependency grammars. These grammars are becoming increasingly important for approaches to statistical parsing in computational l

本能