dependency parsing
play

Dependency Parsing Lecture 2 Overview Nivre's Arc-Eager / - PowerPoint PPT Presentation

May 22, 2023 •288 likes •1.21k views

Dependency Parsing Lecture 2 Overview Nivre's Arc-Eager / Arc-Standard Algorithm Covington's Parsing Strategy Pseudo-projective Parsing Java ML Libraries - OpenNLP MaxEnt - Mallet - Liblinear Arc-Standard Algorithm Two

  1. Dependency Parsing Lecture 2

  2. Overview ● Nivre's Arc-Eager / Arc-Standard Algorithm ● Covington's Parsing Strategy ● Pseudo-projective Parsing ● Java ML Libraries - OpenNLP MaxEnt - Mallet - Liblinear

  3. Arc-Standard Algorithm ● Two stacks: - Stack with tokens that still have to be processed ( Input Stack ) - Stack with tokens that already have been processed ( Processed Stack ) ● One set: - Set of predicted dependency pairs ● Initial configuration: - Processed Stack with “0“ on top of it. Input Stack with the whole input on it. ● Terminal configuration: - Empty Processed Stack

  4. Arc-Standard Parsing Algorithm Leftarc ● - Makes the top token of the input stack the head of the top token of the processed stack - Pops the top token from the processed stack Rightarc ● if the top token of the processed stack already has been attached to all of its dependents to the right : - Makes it the head of the top token of the input stack - Pops the top token from the input stack - Moves the top token of the processed stack on top of the input stack Shift ● - Moves the top token of the input stack on top of the processed stack

  5. Input 1 A DT _ _ 2 hearing NN _ _ 3 on IN _ _ 4 the DT _ _ 5 issue NN _ _ 6 is VBZ _ _ 7 scheduled VBN _ _ 8 today NN _ _ 9 . . _ _

  6. Arc-Standard Parsing Example [ ] [0] [9, 8, 7, 6, 5, 4, 3, 2, 1] Shift 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  7. Arc-Standard Parsing Example [ ] [0, 1] [9, 8, 7, 6, 5, 4, 3, 2] Leftarc 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  8. Arc-Standard Parsing Example [(1,2)] [0] [9, 8, 7, 6, 5, 4, 3, 2] Shift Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  9. Arc-Standard Parsing Example [(1,2)] [0, 2] [9, 8, 7, 6, 5, 4, 3] Shift Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  10. Arc-Standard Parsing Example [(1,2)] [0, 2, 3] [9, 8, 7, 6, 5, 4] Shift Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  11. Arc-Standard Parsing Example [(1,2)] [0, 2, 3, 4] [9, 8, 7, 6, 5] Leftarc Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  12. Arc-Standard Parsing Example [(1,2), (4,5)] [0, 2, 3] [9, 8, 7, 6, 5] Rightarc Det Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  13. Arc-Standard Parsing Example [(1,2), (4,5), (5,3)] [0, 2] [9, 8, 7, 6, 3] Rightarc PC Det Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  14. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2)] [0] [9, 8, 7, 6, 2] Shift PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  15. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2)] [0, 2] [9, 8, 7, 6] Leftarc PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  16. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6)] [0] [9, 8, 7, 6] Leftarc SBJ PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  17. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0)] [ ] [9, 8, 7, 6] Shift ROOT SBJ PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  18. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0)] [6] [9, 8, 7] Shift ROOT SBJ PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  19. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0)] [6, 7] [9, 8] Rightarc ROOT SBJ PC Det NMOD Det 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  20. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0), (8,7)] [6] [9, 7] Rightarc ROOT SBJ PC Det NMOD Det ADV 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  21. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0), (8,7), (7,6)] [ ] [9, 6] Shift ROOT SBJ PC Det NMOD Det PC ADV 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  22. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0), (8,7), (7,6)] [6] [9] Rightarc ROOT SBJ PC Det NMOD Det PC ADV 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  23. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0), (8,7), (7,6), (9,6)] [ ] [6] Shift ROOT SBJ PC P Det NMOD Det PC ADV 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  24. Arc-Standard Parsing Example [(1,2), (4,5), (5,3), (3,2), (2,6), (6,0), (8,7), (7,6), (9,6)] [6] [ ] Shift ROOT SBJ PC P Det NMOD Det PC ADV 0 A 1 hearing 2 on 3 the 4 issue 5 is 6 scheduled 7 today 8 . 9

  25. Output 1 A DT 2 DET 2 hearing NN 6 SBJ 3 on IN 2 NMOD 4 the DT 5 DET 5 issue NN 3 OC 6 is VBZ 0 ROOT 7 scheduled VBN 6 PC 8 today NN 7 ADV 9 . . 6 P

  26. Fundamental Parsing Algorithm ● Go through all words in the sentence and for every word j try to combine it with the words 1 .. j- 1 ● Dependents of any given word are more likely to be near it than far away, therefore work backwards through j-1 , j-2 etc, rather than forwards from 1 to 2 , 3 etc. ● Don‘t consider not permissible pairs (don‘t look for a parent if a word already has one, pairs which introduce cycles etc.)

  27. Fundamental Parsing Algorithm Operations ● Given the current word j and a word i < j there are three operations: ● Link(i, j) - Creates a dependency pair with j being the head of i ● Link(j, i) - Creates a dependency pair with i being the head of j ● Shift - Rejects the current pair and moves on

  28. Input 1 She PRP _ _ 2 was VBD _ _ 3 the DT _ _ 4 first JJ _ _ 5 woman NN _ _ 6 to TO _ _ 7 be VB _ _ 8 appointed VBN _ _ 9 FCC NNP _ _ 10 general JJ _ _ 11 counsel NN _ _ 12 . . _ _

  29. Fundamental Parsing Algorithm Example [ ] j: 1 i: 0 {l1=0.016, shift =0.9832} 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  30. Fundamental Parsing Algorithm Example [ ] j: 2 i: 1 { l2 =0.8848, l1=0.0083, shift=0.1069} 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  31. Fundamental Parsing Algorithm Example [(1,2)] j: 2 i: 0 { l1 =0.6437, shift=0.2547} SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  32. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 3 i: 2 { l1 =0.6437, shift=0.2547} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  33. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 4 i: 3 {l2=0.0224, l1=0.0, shift =0.9776} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  34. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 4 i: 2 {l1=0.0745, shift =0.9247} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  35. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 4 i: 1 {l1=0.0, shift =0.9998} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  36. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 4 i: 0 {l1=5.0E-4, shift =0.9995} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

  37. Fundamental Parsing Algorithm Example [(1,2), (2,0)] j: 5 i: 4 { l2 =0.8812, l1=0.013, shift=0.1058} ROOT SBJ 0 She 1 was 2 the 3 first 4 woman 5 to 6 be 7 appointed 8 FCC 9 general 10 counsel 11 . 12

Recommend

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr Sprachwissenschaft November 2016 Recap/background Dependency grammar Dependency parsing Evaluation Summary Ingredients of a parser

1.44k views • 89 slides
Dependency Parsing &amp; Feature-based Parsing Ling571 Deep Processing Techniques for NLP

Dependency Parsing &amp; Feature-based Parsing Ling571 Deep Processing Techniques for NLP

Dependency Parsing &amp; Feature-based Parsing Ling571 Deep Processing Techniques for NLP February 2, 2015 Roadmap Dependency parsing Graph-based dependency parsing Maximum spanning tree CLE Algorithm Learning

899 views • 87 slides
Dependency Parsing CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan

Dependency Parsing CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan

Dependency Parsing CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan Jurafsky &amp; James Martin Dependency Parsing Formalizing dependency trees Transition-based dependency parsing Shift-reduce parsing

676 views • 24 slides
Dependency Parsing 2 CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre,

Dependency Parsing 2 CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre,

Dependency Parsing 2 CMSC 723 / LING 723 / INST 725 Marine Carpuat Fig credits: Joakim Nivre, Dan Jurafsky &amp; James Martin Dependency Parsing Formalizing dependency trees Transition-based dependency parsing Shift-reduce parsing

1.02k views • 52 slides
Natural Language Processing Other Syntactic Models Parsing IV Dan Klein UC Berkeley Dependency

Natural Language Processing Other Syntactic Models Parsing IV Dan Klein UC Berkeley Dependency

Natural Language Processing Other Syntactic Models Parsing IV Dan Klein UC Berkeley Dependency Parsing Dependency Parsing Pure dependency parsing is only cubic [Eisner 99] Lexicalized parsers can be seen as producing dependency trees

314 views • 5 slides
Last class Dependency parsing and logistic regression Dependency parsing: a fully lexicalized

Last class Dependency parsing and logistic regression Dependency parsing: a fully lexicalized

Last class Dependency parsing and logistic regression Dependency parsing: a fully lexicalized formalism; tree edges connect words in the Shay Cohen sentence based on head-dependent relationships. (based on slides by Sharon Goldwater) a

359 views • 11 slides
Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs Semantic Parsing Dependency parsing models the syntactic structure between words in a sentence. Dependency Parsing vs Semantic Parsing

637 views • 31 slides
Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit:

Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit:

Dependency Parsing II CMSC 470 Marine Carpuat Graph-based Dependency Parsing Slides credit: Joakim Nivre Directed Spanning Trees Dependency Parsing as Finding the Maximum Spanning Tree Views parsing as finding the best directed spanning

981 views • 61 slides
Dependency Grammars and Parsing CMSC 473/673 UMBC Outline Review: PCFGs and CKY Dependency

Dependency Grammars and Parsing CMSC 473/673 UMBC Outline Review: PCFGs and CKY Dependency

Dependency Grammars and Parsing CMSC 473/673 UMBC Outline Review: PCFGs and CKY Dependency Grammars Dependency Parsing (Shift-reduce) From syntax to semantics Probabilistic Context Free Grammar 1.0 S NP VP 1.0 PP P NP .4 NP Det

862 views • 75 slides
Algorithms for NLP CS 11-711 Fall 2020 Lecture 14: Graph-based dependency parsing Emma

Algorithms for NLP CS 11-711 Fall 2020 Lecture 14: Graph-based dependency parsing Emma

Algorithms for NLP CS 11-711 Fall 2020 Lecture 14: Graph-based dependency parsing Emma Strubell Announcements No recitation on Friday (Tartan Community Day). 2 Dependency parsing 3 Dependency parsing Input buffer Transition-based

1.15k views • 77 slides
Thoughts on Learner Data and Motivation Learner Language Dependency Parsing and Dependency

Thoughts on Learner Data and Motivation Learner Language Dependency Parsing and Dependency

Thoughts on Learner Data and Dependency Parsing Niels Ott, Ramon Ziai, Julia Krivanek, Detmar Meurers Introduction and Thoughts on Learner Data and Motivation Learner Language Dependency Parsing and Dependency Annotation Approximated

812 views • 53 slides
Marina Valeeva Outline 2 1. Introduction What is Dependency Parsing? What is a

Marina Valeeva Outline 2 1. Introduction What is Dependency Parsing? What is a

GRAPH-BASED DEPENDENCY PARSING Marina Valeeva Outline 2 1. Introduction What is Dependency Parsing? What is a Dependency Tree? Projectivity vs. Non-Projectivity 2. Graph-Based Dependency Parsing 3. Models Edge Based Factorization

572 views • 40 slides
Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on Statistical Parsing of Morphologically-Rich Languages 12th International Conference on Parsing Technologies Jinho D. Choi &amp; Martha Palmer

199 views • 19 slides
Graph-based Dependency Parsing (Chu-Liu-Edmonds algorithm) Sam Thomson (with thanks to Swabha

Graph-based Dependency Parsing (Chu-Liu-Edmonds algorithm) Sam Thomson (with thanks to Swabha

Graph-based Dependency Parsing (Chu-Liu-Edmonds algorithm) Sam Thomson (with thanks to Swabha Swayamdipta) University of Washington, CSE 490u February 22, 2017 Outline Dependency trees Three main approaches to parsing

648 views • 54 slides
Lecture 19: Dependency Grammars and Dependency Parsing Julia Hockenmaier juliahmr@illinois.edu

Lecture 19: Dependency Grammars and Dependency Parsing Julia Hockenmaier juliahmr@illinois.edu

CS447: Natural Language Processing http://courses.engr.illinois.edu/cs447 Lecture 19: Dependency Grammars and Dependency Parsing Julia Hockenmaier juliahmr@illinois.edu 3324 Siebel Center Todays lecture Dependency Grammars Dependency

792 views • 54 slides
Dependency Parsing Joakim Nivre Uppsala University Department of Linguistics and Philology

Dependency Parsing Joakim Nivre Uppsala University Department of Linguistics and Philology

Dependency Parsing Joakim Nivre Uppsala University Department of Linguistics and Philology joakim.nivre@lingfil.uu.se Dependency Parsing 1(14) 1. Dependency Trees 2. Arc-Factored Models 3. Online Learning 4. Eisners Algorithm 5.

726 views • 14 slides
Dependency Parsing CMSC 470 Marine Carpuat Dependency Grammars Syntactic structure = lexical

Dependency Parsing CMSC 470 Marine Carpuat Dependency Grammars Syntactic structure = lexical

Dependency Parsing CMSC 470 Marine Carpuat Dependency Grammars Syntactic structure = lexical items linked by binary asymmetrical relations called dependencies Example Dependency Parse Dependencies (usually) form a tree: - Connected -

593 views • 23 slides
Dependency Parsing and Feature-based Parsing Ling 571 Deep Processing Techniques for

Dependency Parsing and Feature-based Parsing Ling 571 Deep Processing Techniques for

Dependency Parsing and Feature-based Parsing Ling 571 Deep Processing Techniques for NLP October 21, 2019 Shane Steinert-Threlkeld 1 Announcements Thanks for the feedback! HW3: mean 92 Handling ungrammaticality:

1.3k views • 70 slides
Soft Cross lingual Syntax Projection for Dependency Parsing Zhenghua Li, Min Zhang, Wenliang

Soft Cross lingual Syntax Projection for Dependency Parsing Zhenghua Li, Min Zhang, Wenliang

Soft Cross lingual Syntax Projection for Dependency Parsing Zhenghua Li, Min Zhang, Wenliang Chen {zhli13, minzhang, wlchen}@suda.edu.cn Soochow University, China Dependency parsing A bilingual example pmod root obj obj det subj

437 views • 41 slides
Advanced Dependency Parsing Joakim Nivre Uppsala University Linguistics and Philology Based on

Advanced Dependency Parsing Joakim Nivre Uppsala University Linguistics and Philology Based on

Advanced Dependency Parsing Joakim Nivre Uppsala University Linguistics and Philology Based on tutorials with Ryan McDonald Advanced Dependency Parsing 1(36) Introduction Plan for the Lecture 1. Graph-based vs. transition-based dependency

1.61k views • 109 slides
A Fast and Accurate Dependency Parser using Neural Networks Danqi Chen &amp; Christopher D.

A Fast and Accurate Dependency Parser using Neural Networks Danqi Chen &amp; Christopher D.

A Fast and Accurate Dependency Parser using Neural Networks Danqi Chen &amp; Christopher D. Manning Qiming Chen qc2195 Apr. 8. 2015 Dependency Parsing Parsing: He has good control . Dependency Parsing Parsing: He has good control .

743 views • 35 slides
Dependency Parsing CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu Slides

Dependency Parsing CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu Slides

Dependency Parsing CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu Slides credit: Joakim Nivre &amp; Ryan McDonald T odays Agenda Formalizing dependency graphs Formalizing transition-based parsing most material

755 views • 26 slides
NLP Programming Tutorial 12 - Dependency Parsing Graham Neubig Nara Institute of Science and

NLP Programming Tutorial 12 - Dependency Parsing Graham Neubig Nara Institute of Science and

NLP Programming Tutorial 12 Dependency Parsing NLP Programming Tutorial 12 - Dependency Parsing Graham Neubig Nara Institute of Science and Technology (NAIST) 1 NLP Programming Tutorial 12 Dependency Parsing Interpreting Language is

244 views • 23 slides
Dependency parsing and logistic regression Shay Cohen (based on slides by Sharon Goldwater) 21

Dependency parsing and logistic regression Shay Cohen (based on slides by Sharon Goldwater) 21

Dependency parsing and logistic regression Shay Cohen (based on slides by Sharon Goldwater) 21 October 2019 Last class Dependency parsing: a fully lexicalized formalism; tree edges connect words in the sentence based on head-dependent

764 views • 43 slides

More recommend