a generative model for punctuation in dependency parsing
play

A Generative Model for Punctuation in Dependency Parsing Xiang - PowerPoint PPT Presentation

Jul 02, 2023 •474 likes •896 views

A Generative Model for Punctuation in Dependency Parsing Xiang Lisa Li*, Dingquan Wang*, and Jason Eisner * Equal Contribution 1 NLP has neglected punctuation T reebanks treat punctuation marks as ordinary tokens, but ARE THEY? The

  1. A Generative Model for Punctuation in Dependency Parsing Xiang Lisa Li*, Dingquan Wang*, and Jason Eisner * Equal Contribution 1

  2. NLP has neglected punctuation T reebanks treat punctuation marks as ordinary tokens, but ARE THEY? The Linguistics of Punctuation , Nunberg (1990) 
 2

  3. Punctuation is useful Punctuation marks are correlated with prosody and the syntactic tree structure. Tree parse generation Punctuation 3

  4. . . . root Hail dobj king rel-clause appos wields the Pendragon dobj . . . who Excalibur Arthur , , , , 4

  5. Point Absorption root Quote Transposition dobj Geoffrey Nunberg rel-clause appos dobj , , , , , , , . . ? ` ` ` ` Hail the king Arthur Pendragon who wields Excalibur , , 7! , , . 7! . , . . ? . 7! . ` ` ` ` ` ` ` ` . ` ` ` ` 5 ?

  6. Summary… • Punctuation marks are not words. • Just as prosody is not words. • They do not belong in the tree. • Only underlying punctuation marks are in the tree, where they surround certain phrases. 6

  7. Tree parse generation underlying punct Punctuation surface punct The surface punctuation has a non-obvious correlation with the tree. surface The underlying punctuation has a more direct correlation with the tree. underlying 7

  8. Tree Attach underlying parse generation punct Rewriting surface punct Let’s exploit the underlying punctuation under a generative model ! 8

  9. <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="d+DA9CD2DeOzt2iu15qUeAVXsI=">AB73icbVA9SwNBEJ3zM8avqKXNYhCswp2NdgZstItgPiA5wt5mkizZ2z1394Rw5E/YWChi678RO/+Nm0sKTXw8Hhvhpl5USK4sb7/7a2srq1vbBa2its7u3v7pYPDhlGpZlhnSijdiqhBwSXWLbcCW4lGkcCm9Hoeuo3H1EbruS9HScYxnQgeZ8zap3U6mBiuFCyWyr7FT8HWSbBnJSvPiFHrVv6vQUS2OUlglqTDvwExtmVFvOBE6KndRgQtmIDrDtqKQxmjDL752QU6f0SF9pV9KSXP09kdHYmHEcuc6Y2qFZ9Kbif147tf3LMOMyS1KNlvUTwWxikyfJz2ukVkxdoQyzd2thA2psy6iIouhGDx5WXSOK8EfiW48vV21kaUIBjOIEzCOACqnADNagDAwFP8AKv3oP37L157PWFW8+cwR/4H38AL1PkTI=</latexit> <latexit sha1_base64="d+DA9CD2DeOzt2iu15qUeAVXsI=">AB73icbVA9SwNBEJ3zM8avqKXNYhCswp2NdgZstItgPiA5wt5mkizZ2z1394Rw5E/YWChi678RO/+Nm0sKTXw8Hhvhpl5USK4sb7/7a2srq1vbBa2its7u3v7pYPDhlGpZlhnSijdiqhBwSXWLbcCW4lGkcCm9Hoeuo3H1EbruS9HScYxnQgeZ8zap3U6mBiuFCyWyr7FT8HWSbBnJSvPiFHrVv6vQUS2OUlglqTDvwExtmVFvOBE6KndRgQtmIDrDtqKQxmjDL752QU6f0SF9pV9KSXP09kdHYmHEcuc6Y2qFZ9Kbif147tf3LMOMyS1KNlvUTwWxikyfJz2ukVkxdoQyzd2thA2psy6iIouhGDx5WXSOK8EfiW48vV21kaUIBjOIEzCOACqnADNagDAwFP8AKv3oP37L157PWFW8+cwR/4H38AL1PkTI=</latexit> <latexit sha1_base64="d+DA9CD2DeOzt2iu15qUeAVXsI=">AB73icbVA9SwNBEJ3zM8avqKXNYhCswp2NdgZstItgPiA5wt5mkizZ2z1394Rw5E/YWChi678RO/+Nm0sKTXw8Hhvhpl5USK4sb7/7a2srq1vbBa2its7u3v7pYPDhlGpZlhnSijdiqhBwSXWLbcCW4lGkcCm9Hoeuo3H1EbruS9HScYxnQgeZ8zap3U6mBiuFCyWyr7FT8HWSbBnJSvPiFHrVv6vQUS2OUlglqTDvwExtmVFvOBE6KndRgQtmIDrDtqKQxmjDL752QU6f0SF9pV9KSXP09kdHYmHEcuc6Y2qFZ9Kbif147tf3LMOMyS1KNlvUTwWxikyfJz2ukVkxdoQyzd2thA2psy6iIouhGDx5WXSOK8EfiW48vV21kaUIBjOIEzCOACqnADNagDAwFP8AKv3oP37L157PWFW8+cwR/4H38AL1PkTI=</latexit> <latexit sha1_base64="AorJNcop2+3GrYx5rhn0K04PhDY=">AB73icbVA9SwNBEJ3zM8avqKXNYhCswp2NlgEb7SKYD0iOsLeZS5bs7Z67e0I48idsLBSx9e/Y+W/cJFdo4oOBx3szMyLUsGN9f1vb219Y3Nru7RT3t3bPzisHB23jMo0wyZTQulORA0KLrFpuRXYSTXSJBLYjsY3M7/9hNpwJR/sJMUwoUPJY86odVKnh6nhQsl+perX/DnIKgkKUoUCjX7lqzdQLEtQWiaoMd3AT2YU205Ezgt9zKDKWVjOsSuo5ImaMJ8fu+UnDtlQGKlXUlL5urviZwmxkySyHUm1I7MsjcT/O6mY2vw5zLNLMo2WJRnAliFZk9TwZcI7Ni4ghlmrtbCRtRTZl1EZVdCMHy6ukdVkL/Fpw71frd0UcJTiFM7iAK6gDrfQgCYwEPAMr/DmPXov3rv3sWhd84qZE/gD7/MHTayQIw=</latexit> P(punctuated tree | unpunctuated tree) . Attach = P( |root, unpunctuated tree) ✏ . . root ✏ dobj rel-clause appos dobj Hail the king Arthur Pendragon who wields Excalibur 9

  10. <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> <latexit sha1_base64="+DWH5JiBwdS2QN1kj023Sw5XGfk=">AB8HicdVDLSgMxFM3UV62vqks3wSK4GjLawXZXdOygn1IO5RMmlDk8yQZIQy9CvcuFDErZ/jzr8x01ZQ0QMXDufcy73hAln2iD04RWVtfWN4qbpa3tnd298v5BW8epIrRFYh6rbog15UzSlmG026iKBYhp51wcpX7nXuqNIvlrZkmNB4JFnECDZWuvTRDMey9KgXEu8u+hyByfeTVz3NSr9eqvg89F81RAUs0B+X3/jAmqaDSEI617nkoMUGlWGE01mpn2qaYDLBI9qzVGJBdZDND57BE6sMYRQrW9LAufp9IsNC6kIbafAZqx/e7n4l9dLTVQLMiaT1FBJFouilEMTw/x7OGSKEsOnlmCimL0VkjFWmBibUR7C16fwf9I+cz3kejfVSuNyGUcRHIFjcAo8cAEa4Bo0QsQIMADeALPjnIenRfndFacJYzh+AHnLdP9I6Qg=</latexit> P(punctuated tree | unpunctuated tree) . Attach P( |root, unpunctuated tree) = ✏ , , . * P( |appos, unpunctuated tree) root dobj , , , rel-clause , appos dobj . Hail the king Arthur Pendragon who wields Excalibur 10

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 &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
Tree-StructuredIndexes Chapter9

Tree-StructuredIndexes Chapter9

Tree-StructuredIndexes Chapter9 DatabaseManagementSystems3ed,R.RamakrishnanandJ.Gehrke 1 Introduction

336 views • 9 slides
Root Canal A new class of SS7 vulnerabilities Agenda SS7 Vulnerable by design

Root Canal A new class of SS7 vulnerabilities Agenda SS7 Vulnerable by design

Outstanding Communications Solutions Root Canal A new class of SS7 vulnerabilities Agenda SS7 Vulnerable by design Acknowledged signalling vulnerabilities The root problem Mitigation The signaling band-aid A new class

787 views • 54 slides
Class invariants by the CRT method Andreas Enge Andrew V. Sutherland INRIA Bordeaux-Sud-Ouest

Class invariants by the CRT method Andreas Enge Andrew V. Sutherland INRIA Bordeaux-Sud-Ouest

Class invariants by the CRT method Andreas Enge Andrew V. Sutherland INRIA Bordeaux-Sud-Ouest Massachusetts Institute of Technology ANTS IX Andreas Enge and Andrew Sutherland Class invariants by the CRT method 1 of 17 Constructing an

308 views • 18 slides
Lecture 15: Dependency Parsing Kai-Wei Chang CS @ University of Virginia kw@kwchang.net Couse

Lecture 15: Dependency Parsing Kai-Wei Chang CS @ University of Virginia kw@kwchang.net Couse

Lecture 15: Dependency Parsing Kai-Wei Chang CS @ University of Virginia kw@kwchang.net Couse webpage: http://kwchang.net/teaching/NLP16 CS6501: NLP 1 How to represent the structure CS6501: NLP 2 Dependency trees v Dependency grammar

703 views • 51 slides
Dont forget your roots: constant-time root finding over F 2 m Douglas Martins 1 Gustavo Banegas

Dont forget your roots: constant-time root finding over F 2 m Douglas Martins 1 Gustavo Banegas

Dont forget your roots: constant-time root finding over F 2 m Douglas Martins 1 Gustavo Banegas 2 , 3 Ricardo Custdio 1 1 Departamento de Informtica e Estatstica, Universidade Federal de Santa Catarina 2 Department of Mathematics and

401 views • 22 slides
Relational Graph Processing on GPUs Haicheng Wu 1 , Daniel Zinn 2 , Molham Aref 2 , Sudhakar

Relational Graph Processing on GPUs Haicheng Wu 1 , Daniel Zinn 2 , Molham Aref 2 , Sudhakar

Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs Haicheng Wu 1 , Daniel Zinn 2 , Molham Aref 2 , Sudhakar Yalamanchili 1 1. Georgia Institute of Technology 2. LogicBlox Inc. SCHOOL OF ELECTRICAL AND COMPUTER

796 views • 44 slides
Verified error b oun d s f or multipl e roots o f syst e ms o f nonlin ea r e qu a tions St ef Gr a

Verified error b oun d s f or multipl e roots o f syst e ms o f nonlin ea r e qu a tions St ef Gr a

Verified error b oun d s f or multipl e roots o f syst e ms o f nonlin ea r e qu a tions St ef Gr a ill a t LIP6/P E QU A N , Sor b onn e Univ e rsit s , UPM C Univ P a ris 06 , C NRS Joint work with Si e g f ri ed M. Rump Journ e s m tho de

745 views • 42 slides
Trees Trees Nonrecursive definition: An edge connects parent and child. A (rooted) tree

Trees Trees Nonrecursive definition: An edge connects parent and child. A (rooted) tree

CS206 CS206 Trees Trees Nonrecursive definition: An edge connects parent and child. A (rooted) tree consists of a set of nodes, and a set of directed A node without children is a leaf. edges between nodes. Nodes with the same parent are

282 views • 4 slides

More recommend