dependency parsing of hungarian

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

... word. 92 Statistical Dependency Parsing of Turkish G ¨ uls¸en Eryi ˇ git Department of Computer Engineering Istanbul Technical University Istanbul, 34469, Turkey gulsen@cs.itu.edu.tr Kemal Oflazer Faculty of Engineering ... tag of the head IG in- 6 This choice is based on the observation that in the tree- bank, 85.6% of the dependency links land on the first (and possibly the only) IG of the head word, while 14.4% of ... average of about 8 words; 8 90% of the sentences had less than or equal to 15 words. In terms of IG s, the sentences comprised 2 to 55 IGs with an average of 10 IG s per sentence; 90% of the sentences...

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

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

... accuracy of model (d) is comparable to that of our model, we can conclude that the con- sideration of the syntactic property of a verb does not necessarily improve dependency analysis. The accuracy of ... results of automatic dependency parsing of large-scale corpora. The results of an experiment in which our method was used to rerank the results obtained using an existing machine learning based parsing method ... Computational Linguistics Japanese Dependency Parsing Using Co-occurrence Information and a Combination of Case Elements Takeshi Abekawa Graduate School of Education University of Tokyo abekawa@p.u-tokyo.ac.jp Manabu...

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

... pro- vide state -of- the-art performance across multiple languages. However, the parsing algorithms re- quire that the score of a dependency tree factors as a sum of the scores of its edges. This ... O(n 3 ) extension of the Eisner algorithm to second-order dependency parsing. This figure shows how h 1 creates a dependency to h 3 with the second-order knowledge that the last dependent of h 1 was ... non- projective parsing algorithm. of dependents have been gathered. T his allows for the collection of pairs of adjacent dependents in a single stage, which allows for the incorporation of second-order...

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

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

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

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

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

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

... Algorithm of Japanese dependency pars- ing that the algorithm in Figure 4 does not generate every pair of bunsetsus. 3 4 Active Learning for Parsing Most of the methods of active learning for parsing in ... discuss algorithms of Japanese parsing and active learning for it. 3.3 Algorithm of Japanese Dependency Parsing We use Sassano’s algorithm (Sassano, 2004) for Japanese dependency parsing. The reason ... selected at each iteration of active learning. 6.6 Dependency Accuracy We use dependency accuracy as a performance measure of a parser. The dependency accuracy is the percentage of correct dependencies....

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

... importance of a consistent standard of evaluation. A few works explored the effects of annotation conventions on parsing performance. Nilsson et al. (2006) transformed the dependency annotations of coordinations ... originated. The training set of each corpus consists of sec- tions 2–21 of WSJ20 (i.e., WSJ sentences of length ≤20, excluding punctuation) 13 and the test set is sec- tion 23 of WSJ ∞ . Evaluation ... Laboratory Massachusetts Institute of Technology roiri@csail.mit.edu Abstract Dependency parsing is a central NLP task. In this paper we show that the common eval- uation for unsupervised dependency parsing is highly...

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

... features, but capable of capturing larger classes of errors (e.g., incorrect number or types of arguments). We include the number of violations from four different classes of errors. To improve ... sequence of dependency labels along the corresponding path; and (b) the word to be classified, the last token in each path, and the sequence of dependency labels in that path. • Bag -of- word and ... Tree Algorithms. Proceedings of HLT/EMNLP. Ryan McDonald and Fernando Pereira. 2006. Online Learning of Approximate Dependency Parsing Algo- rithms. Proceedings of EACL. Scott Miller, Michael...

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

... mul- tilingual dependency parsing with a generative latent variable model. In Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL, pages 947–951. 17 Proceedings of the 49th Annual Meeting of the ... Machines for Dependency Parsing Nikhil Garg Department of Computer Science University of Geneva Switzerland nikhil.garg@unige.ch James Henderson Department of Computer Science University of Geneva Switzerland james.henderson@unige.ch Abstract We ... to dependency parsing. We focus on Shift-Reduce transition-based parsing proposed by Nivre et al. (2004). In this class of algorithms, at any given step, the parser has to choose among a set of...

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

... r-arborescence 2 of the directed graph D if V, B is a (directed) tree rooted at r. We define the set of legal dependency parse trees of x (denoted Y(x)) as the set of 0-arborescences of D, i.e., ... focus on unlabeled dependency parsing, for clarity of exposition. If it is extended to labeled parsing (a straightforward extension), our formu- lation fully subsumes that of Riedel and Clarke (2006), ... for example in the form of hard or soft first- order logic constraints (Richardson and Domin- gos, 2006; Chang et al., 2008). 2 Dependency Parsing 2.1 Preliminaries A dependency tree is a lightweight...

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

... Online learning of approximate dependency parsing algo- rithms. In Proceedings of EACL, pages 81–88. Ryan McDonald and Giorgio Satta. 2007. On the com- plexity of non-projective data-driven dependency parsing. ... 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 ... non-projective dependency parser. In Pro- ceedings of CoNLL, pages 166–170. Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proceedings of CoNLL,...

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

... training of dependency parsers. In Proc. of ACL, pages 91–98. R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005b. Non-projective dependency parsing using spanning tree algorithms. In Proc. of ... uses the same set of features and learning algorithm. In the case of dependency parsing for Czech, (McDonald et al., 2005b) even outperforms projective parsing, and was one of the top systems ... build dependency structure left-to- right in time O(n 2 ) during decoding. Most in- terestingly, the time complexity of non-projective dependency parsing remains quadratic as the or- der of the...

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

... lower. Table 6 compares the performances of several of the state of the art dependency parsing systems with ours. When comparing with other depen- dency parsing systems it is especially worth notic- ing ... algorithm for projective dependency parsing. In IWPT, Nancy, France. V. Punyakanok, D. Roth, and W. Yih. 2005. The necessity of syntactic parsing for semantic role labeling. In Proc. of the International ... the parent of a, Left: a is the parent of b. This is a true pipeline approach in that the clas- sifiers are trained on individual decisions rather than on the overall quality of the parsing, and chained...

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

... to three problems in incremental dependency parsing, the last of which being prediction of full labeled dependency trees. Our system can be seen as a unification of the two best-performing parsers ... Construction of a Basque dependency treebank. I n Proceedings of the TLT, pages 201–204. Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In Proceedings of ... stack S and a list of input words W , and builds the parse tree incrementally using a set of parsing actions (see Table 1). However, instead of finding constituents, it builds a set of arcs representing...

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

... parsing of Czech. 1 Introduction It is sometimes claimed that one of the advantages of dependency grammar over approaches based on constituency is that it allows a more adequate treat- ment of ... dependency parsing is to construct a labeled dependency graph of the kind de- picted in Figure 1. Formally, we define dependency graphs as follows: 1. Let R = {r 1 , . . . , r m } be the set of ... their proper place in the dependency graph, giving rise 1 The dependency graph has been modified to make the final period a dependent of the main verb instead of being a depen- dent of a special root node...

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