0

dependency parsing and projection

Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Japanese Dependency Parsing Using Co-occurrence Information and a Combination of Case Elements" pdf

Báo cáo khoa học

... proba-bilities, and is fixed to the best value by consider-ing development data (different from the trainingdata)1.RerankingCandidate 1Candidate 2Candidate 3Candidate 4: Case element: VerbCandidateCandidateFigure ... set and the verb, and wecall P(ni,j(T )|ri,j(T ), vi(T )) the co-occurrenceprobability of the case element set and the verb.In the actual dependency analysis, we try to se-lect the dependency ... data.The best parse which uses this data set is (Kudo and Matsumoto, 2005), and their parsing accuracyis 91.37%. The features and the parsing methodused by their model are almost equal to...
  • 8
  • 481
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Logistic Online Learning Methods and Their Application to Incremental Dependency Parsing" doc

Báo cáo khoa học

... Collins and Nigel Duffy. 2002. New rankingalgorithms for parsing and tagging: Kernels over dis-crete structures, and the voted perceptron. In Proceed-ings of the ACL.Koby Crammer and Yoram ... Machine Intelligence, 27(6).John Lafferty, Andrew McCallum, and Fernando Pereira.2001. Conditional random fields: Probabilistic mod-els for segmenting and labeling sequence data. In Pro-ceedings ... al.,2001; Taskar et al., 2006), constituent and depen-dency parsing (Collins and Duffy, 2002; McDon-ald et al., 2005), and logical form extraction (Zettle-moyer and Collins, 2005).Machine learning...
  • 6
  • 470
  • 0
Báo cáo khoa học:

Báo cáo khoa học: "Incremental Joint Approach to Word Segmentation, POS Tagging, and Dependency Parsing in Chinese" potx

Báo cáo khoa học

... w.r.t. the training epoch (x-axis) and parsing feature weights (in legend).tagging (Zhang and Clark, 2008; Zhang and Clark,2010) and dependency parsing (Huang and Sagae,2010). Therefore, we can ... SH(t).1048interaction between segmentation and POS tagging.3 Model3.1 Incremental Joint Segmentation, POSTagging, and Dependency Parsing Based on the joint POS tagging and dependency parsing model by Hatori ... q−1 and q−2respectively denote the last-shifted word and theword shifted before q−1. q.w and q.t respectively denote the(root) word form and POS tag of a subtree (word) q, and q.b and q.e...
  • 9
  • 523
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Using Smaller Constituents Rather Than Sentences in Active Learning for Japanese Dependency Parsing" docx

Báo cáo khoa học

... parsing. Weuse Japanese dependency parsing as a target taskin this study since a simple and efficient algorithmof parsing is proposed and, to our knowledge, ac-tive learning for Japanese dependency ... algorithms of Japanese parsing and active learning for it.3.3 Algorithm of Japanese Dependency Parsing We use Sassano’s algorithm (Sassano, 2004) forJapanese dependency parsing. The reason for ... active learning methods forJapanese dependency parsing. We proposeactive learning methods of using partial dependency relations in a given sentencefor parsing and evaluate their effective-ness...
  • 10
  • 432
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation" doc

Báo cáo khoa học

... A dependency structure on the wordsw1, w2, w3before (Figure 3(a)) and after (Figure 3(b)) anedge-flip of w2→w3, and when the direction of the edgebetween w2 and w3is switched and ... noun and its determiner. K¨ubler (2005)compared two different conversion schemes in Ger-man supervised constituency parsing and found oneto have positive influence on parsing quality. Dependency ... MBR while we used Viterbi) and a different conversion pro-cedure (saj10a used (Collins, 1999) and not (Yamada and Mat-sumoto, 2003)) ; see Section 5.666tion changes, and present a new evaluation...
  • 10
  • 411
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Event Extraction as Dependency Parsing" pdf

Báo cáo khoa học

... sequence of dependency labels alongthe corresponding path; and (b) the word to beclassified, the last token in each path, and thesequence of dependency labels in that path.• Bag-of-word and entity ... that serves asan event anchor, and that the event-argument struc-tures be mapped to a dependency tree. The conver-sion between event and dependency structures and the reranker metric are the ... la-beled dependency links between them. Many de-pendency parsers are available and we chose MST-Parser for its ability to produce non-projective and n-best parses directly. MSTParser frames parsing as...
  • 10
  • 525
  • 1
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Temporal Restricted Boltzmann Machines for Dependency Parsing" pdf

Báo cáo khoa học

... structure required by parsing. In this pa-per, we analyze and contrast ISBNs with TRBMs and show that the latter provide an accurate and theoretically sound model for parsing with high-dimensional ... Nivre and R. McDonald. 2008. Integrating graph-based and transition-based dependency parsers. Pro-ceedings of ACL-08: HLT, pages 950–958.J. Nivre, J. Hall, and J. Nilsson. 2004. Memory-based dependency ... Col-lobert and Weston, 2008), Bayesian networks (Titov and Henderson, 2007a), and Deep Belief Networks(Hinton et al., 2006). In this paper, we investi-gate how these models can be applied to dependency parsing. ...
  • 7
  • 414
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Concise Integer Linear Programming Formulations for Dependency Parsing" pptx

Báo cáo khoa học

... Rsibl, and zgrandijk≤ zij, zgrandijk≤ zjk, zgrandijk≥ zij+zjk−1(15)for all triples i, j, k ∈ Rgrand. Let R  A ∪Rsibl∪ Rgrand; by redefining z  zrr∈R and F(x) ... projective parsing (Eis-ner, 1996; Paskin, 2001; Yamada and Matsumoto,2003; Nivre and Scholz, 2004; McDonald et al.,2005a) and non-projective parsing systems (Nivre and Nilsson, 2005; Hall and N´ov´ak, ... projective parsing (Eis-ner, 1996; Paskin, 2001; Yamada and Matsumoto,2003; Nivre and Scholz, 2004; McDonald et al.,2005a) and non-projective parsing systems (Nivre and Nilsson, 2005; Hall and N´ov´ak,...
  • 9
  • 407
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Non-Projective Dependency Parsing in Expected Linear Time" pptx

Báo cáo khoa học

... techniques for non-projective dependency parsing. In Proceedings of EACL, pages 478–486.Ryan McDonald and Fernando Pereira. 2006. Onlinelearning of approximate dependency parsing algo-rithms. In ... Buchholz and Erwin Marsi. 2006. CoNLL-Xshared task on multilingual dependency parsing. InProceedings of CoNLL, pages 149–164.Michael A. Covington. 2001. A fundamental algo-rithm for dependency parsing. ... 81–88.Ryan McDonald and Giorgio Satta. 2007. On the com-plexity of non-projective data-driven dependency parsing. In Proceedings of IWPT, pages 122–131.Ryan McDonald, Koby Crammer, and FernandoPereira....
  • 9
  • 627
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf

Báo cáo khoa học

... in multilingual dependency parsing. 2.1 O(n2)-time dependency parsing for MTWe now formalize weighted non-projective de-pendency parsing similarly to (McDonald et al.,2005b) and then describe ... (Zhang and Gildea, 2008; Petrov et al., 2008) and rescor-ing approaches (Huang and Chiang, 2007). In thelatter paper, Huang and Chiang introduce rescor-ing methods named “cube pruning” and “cubegrowing”, ... uses thesame set of features and learning algorithm. In thecase of dependency parsing for Czech, (McDonaldet al., 2005b) even outperforms projective parsing, and was one of the top systems...
  • 9
  • 514
  • 0
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "A Pipeline Framework for Dependency Parsing" ppt

Báo cáo khoa học

... (Ya-mada and Matsumoto, 2003) parsing algorithm and show that this results in modifying some ofthe decisions made there and, consequently, betteroverall dependency trees.2 Efficient Dependency Parsing This ... somesense, and that the decisions we made, guided bythese, principles lead to a significant improvementin the accuracy of the resulting parse tree.1.1 Dependency Parsing and Pipeline Models Dependency ... words,their POS tags and also these features of the chil-dren of w1 and w2. We also include the lexicon and POS tags of 2 words before w1 and 4 wordsafter w2(as in (Yamada and Matsumoto, 2003)).The...
  • 8
  • 581
  • 0

Xem thêm