dependency parsing
play

Dependency Parsing Guest lecture in Computational Linguistics course - PowerPoint PPT Presentation

Oct 19, 2022 •305 likes •1.26k views

Dependency Parsing Guest lecture in Computational Linguistics course Barbara Plank bplank.github.io 11-10-2018 Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 1 / 77 Why Parsing? Barbara Plank bplank.github.io Dependency

  1. Dependency Parsing Guest lecture in Computational Linguistics course Barbara Plank bplank.github.io 11-10-2018 Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 1 / 77

  2. Why Parsing? Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 2 / 77

  3. Why Parsing? For Whom? Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 3 / 77

  4. For Whom? Researchers working on syntax or related topics within other traditions Researchers and application developers interested in using parsers as components in larger systems Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 4 / 77

  5. Two views of grammatical structure So far (a.o.): Constituency structure (a.k.a. phrase structure - CFGs) Today: Dependency structure Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 5 / 77

  6. Today Introduction 1 Transition-based parsing 2 Evaluation 3 Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 6 / 77

  7. Outline Introduction 1 Introduction to UD Transition-based parsing 2 Evaluation 3 Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 7 / 77

  8. The notion of dependency In a dependency grammar, syntactic structures consist of words that are linked pairwise by relations called dependencies . The following slides are based on a tutorial by J.Nivre et al: http: //universaldependencies.org/eacl17tutorial/intro.pdf Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 8 / 77

  9. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 9 / 77

  10. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 10 / 77

  11. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 11 / 77

  12. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 12 / 77

  13. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 13 / 77

  14. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 14 / 77

  15. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 15 / 77

  16. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 16 / 77

  17. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 17 / 77

  18. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 18 / 77

  19. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 19 / 77

  20. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 20 / 77

  21. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 21 / 77

  22. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 22 / 77

  23. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 23 / 77

  24. Introduction to UD Introduction Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 24 / 77

  25. Naming nodes in a dependency rel(head,dep) head vs dependent governor vs modifier regent vs subordinate parent vs child In the convention we use, dependency edges go from head to dependent: nsubj(runs,He) . nsubj He runs Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 25 / 77

  26. Example “They ate the pizza with anchovies” Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 26 / 77

  27. Example “They ate the pizza with anchovies” Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 26 / 77

  28. Dependency Trees: Universal dependencies “They ate the pizza with anchovies” nmod dobj nsubj det case They ate the pizza with anchovies dobj nmod nsubj det case They ate the pizza with anchovies Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 27 / 77

  29. Outline Introduction 1 Transition-based parsing 2 Choosing the Right Actions Representing configurations using feature templates Evaluation 3 Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 28 / 77

  30. What is Transition-based Parsing? One of the two leading approaches for dependency parsing Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 29 / 77

  31. What is Transition-based Parsing? One of the two leading approaches for dependency parsing Approach 1: Transition-based parsing: local decisions Approach 2: Graph-based parsing: global decision (find globally best tree; computationally more expensive; we will not cover this) Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 29 / 77

  32. Why Transition-based Parsing? left to right: similar to how the human brain does it in recent years: state-of-the-art accuracy very fast simple flexible: also suitable for producing phrase-structure trees, CCG derivations, semantic representations... (see next lectures) Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 30 / 77

  33. Transition-based Parsing: How? Intuition: Read sentence word by word, left to right Build up the dependency tree one word at a time: after each word, look at the current parser configuration select a parser operation from a set of operations consulting a machine-learned classifier Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 31 / 77

  34. What is a parser configuration? Configuration: Buffer B (words left, at the start entire sentence) Stack S (last in, first out) Relations R (dependency edges predicted so far, a partial parse) Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 32 / 77

  35. Transition-based parsing Configuration: Buffer B (words left, at the start entire sentence) Stack S (last in, first out) Relations R (dependency edges predicted so far, a partial parse) Configuration C = S , B , R Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 33 / 77

  36. Transition-based parsing Configuration: Buffer B (words left, at the start entire sentence) Stack S (last in, first out) Relations R (dependency edges predicted so far, a partial parse) Configuration C = S , B , R Initial configuration: empty stack, all words on buffer, empty R Final configuration: stack, empty buffer, all edges are in R Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 33 / 77

  37. Transition-based parsing Configuration: Buffer B (words left, at the start entire sentence) Stack S (last in, first out) Relations R (dependency edges predicted so far, a partial parse) Configuration C = S , B , R Initial configuration: empty stack, all words on buffer, empty R Final configuration: stack, empty buffer, all edges are in R Parser does a search through the space of possible configurations Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 33 / 77

  38. Basic actions (simplified) The parser has 3 basic operations (other variants possible): Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 34 / 77

  39. Basic actions (simplified) The parser has 3 basic operations (other variants possible): Shift: Move a word from the buffer to the stack Left: Create an edge to the left Right: Create an edge to the right (This transition system with 3 operations is called arc-standard ) Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 34 / 77

  40. Basic actions (details) The parser has 3 basic operations (other variants possible): Shift: Move a word from the buffer to the stack ( S , i | j | B , A ) → ( S | i , j | B , A ) Left: Create an edge to the left ( S | i | j , B , A ) → ( S | j , B , A ∪ j → i ) [create an edge from j to i, where j is the first and i the second node from the top of the stack; in addition removes i from stack)] Right: Create an edge to the right ( S | i | j , B , A ) → ( S | i , B , A ∪ i → j ) [create an edge from i to j, where i is the second and j the first node on top of the stack; pops j from the stack] Details in http: //stp.lingfil.uu.se/~nivre/master/transition.pdf Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 35 / 77

  41. Transition-based Dependency Parsing buffer = [’They’, ’ate’, ’the’, ’pizza’, ’with’, anchovies’] stack = [] Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 36 / 77

  42. Transition-based Dependency Parsing buffer = [’They’, ’ate’, ’the’, ’pizza’, ’with’, anchovies’] stack = [] while len(buffer) > 0 or len(stack) > 1: action = choose_action(buffer, stack) if action == ’SHIFT’: stack.append(i) elif action == ’LEFT’: parse.add(stack[-2], stack.pop()) elif action == ’RIGHT’: parse.add(i, stack.pop()) Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 36 / 77

  43. Example Stack: [] Buffer: [They, ate, the, pizza, with, anchovies] R: [] Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 37 / 77

  44. Example Stack: [They] Buffer: [ate, the, pizza, with, anchovies] R: [] SHIFT , Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 38 / 77

  45. Example Stack: [They, ate] Buffer: [the, pizza, with, anchovies] R: [] SHIFT , SHIFT Barbara Plank bplank.github.io Dependency Parsing 11-10-2018 39 / 77

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

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 & Feature-based Parsing Ling571 Deep Processing Techniques for NLP

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

Dependency Parsing & 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 & 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 & 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 & 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
Seth Cable Introduction to Linguistic Theory Spring 2018 Linguistics 201 Some Notes and Practice

Seth Cable Introduction to Linguistic Theory Spring 2018 Linguistics 201 Some Notes and Practice

Seth Cable Introduction to Linguistic Theory Spring 2018 Linguistics 201 Some Notes and Practice Problems on Syntactic Tree Structures 1. Some Notes on Drawing Syntactic Trees In any Introduction to Linguistics course, there comes a time

264 views • 15 slides
Competency questions for ontologies COMP62342 Sean Bechhofer (with thanks to Robert Stevens)

Competency questions for ontologies COMP62342 Sean Bechhofer (with thanks to Robert Stevens)

Competency questions for ontologies COMP62342 Sean Bechhofer (with thanks to Robert Stevens) Previously on COMP62342 Last week, what is a knowledge representation and what is an ontology; Gaining operational knowledge of using OWL and

463 views • 8 slides
Dua ual P Pha hase se l light ght simul ulati tion i in n LArSoft ArSoft Simulation of

Dua ual P Pha hase se l light ght simul ulati tion i in n LArSoft ArSoft Simulation of

Dua ual P Pha hase se l light ght simul ulati tion i in n LArSoft ArSoft Simulation of the Light production in the GAr phase. Jos Soto, Michel Sorel, Beatriz Tapia J. Soto - 1 / 17 - 17 - | 17 17/07 07/18 Goal of this talk

404 views • 17 slides
The Grid Currently almost no storage (JIT system) Delivery in much less than 0.1 s from

The Grid Currently almost no storage (JIT system) Delivery in much less than 0.1 s from

The Grid Currently almost no storage (JIT system) Delivery in much less than 0.1 s from production Not much control; source and sinks and resistance govern (distance doesnt matter much) Loss in transmission is only about 7% 1/5 of US power

1.27k views • 84 slides
Neural Language Models CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu With

Neural Language Models CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu With

Neural Language Models CMSC 723 / LING 723 / INST 725 M ARINE C ARPUAT marine@cs.umd.edu With slides from Graham Neubig and Philipp Koehn Roadmap Modeling Sequences First example: language model What are n-gram models? How to

943 views • 44 slides
Language Models (2) CMSC 470 Marine Carpuat Slides credit: Jurasky & Martin Roadmap

Language Models (2) CMSC 470 Marine Carpuat Slides credit: Jurasky & Martin Roadmap

Language Models (2) CMSC 470 Marine Carpuat Slides credit: Jurasky & Martin Roadmap Language Models Our first example of modeling sequences n-gram language models How to estimate them? How to evaluate them? Neural

525 views • 24 slides
P ( w 1 w 2 w n ) P ( w i | w i k w i 1 ) i In other words, we

P ( w 1 w 2 w n ) P ( w i | w i k w i 1 ) i In other words, we

10/17/19 Language models Chapter 3 in Martin/Jurafsky N-gram models using the Markov assumption P ( w 1 w 2 w n ) P ( w i | w i k w i 1 ) i In other words, we approximate each component in the product as P ( w i | w

358 views • 14 slides
Natural Language Processing (CSE 490U): Compositional Semantics Noah Smith 2017 c

Natural Language Processing (CSE 490U): Compositional Semantics Noah Smith 2017 c

Natural Language Processing (CSE 490U): Compositional Semantics Noah Smith 2017 c University of Washington nasmith@cs.washington.edu March 1, 2017 1 / 56 Bridging the Gap between Language and the World In order to link NL to a knowledge

880 views • 56 slides

More recommend