Parsing David Kauchak CS159 – Spring 2019 Admin
1 / 1

Parsing David Kauchak CS159 – Spring 2019 Admin

Author : cheryl-pisano | Published Date : 2025-05-23

Description: Parsing David Kauchak CS159 Spring 2019 Admin Assignment 3 Quiz 1 Q1 28 77 Q2 32 89 Q3 33 92 Average 30 84 Parsing Parsing is the field of NLP interested in automatically determining the syntactic structure of a sentence

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Parsing David Kauchak CS159 – Spring 2019 Admin" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Transcript:Parsing David Kauchak CS159 – Spring 2019 Admin:
Parsing David Kauchak CS159 – Spring 2019 Admin Assignment 3 Quiz #1 Q1: 28 (77%) Q2: 32 (89%) Q3: 33 (92%) Average: 30 (84%) Parsing Parsing is the field of NLP interested in automatically determining the syntactic structure of a sentence parsing can also be thought of as determining what sentences are “valid” English sentences Parsing We have a grammar, determine the possible parse tree(s) Let’s start with parsing with a CFG (no probabilities) S  NP VP NP  PRP NP  N PP VP  V NP VP  V NP PP PP  IN N PRP  I V  eat N  sushi N  tuna IN  with I eat sushi with tuna approaches? algorithms? Parsing Top-down parsing ends up doing a lot of repeated work doesn’t take into account the words in the sentence until the end! Bottom-up parsing constrain based on the words avoids repeated work (dynamic programming) doesn’t take into account the high-level structure until the end! CKY parser Parsing Top-down parsing start at the top (usually S) and apply rules matching left-hand sides and replacing with right-hand sides Bottom-up parsing start at the bottom (i.e. words) and build the parse tree up from there matching right-hand sides and replacing with left-hand sides Parsing Example S VP Verb NP book Det Nominal that Noun flight book that flight Top Down Parsing S Pronoun Top Down Parsing S Pronoun Top Down Parsing S ProperNoun Top Down Parsing S ProperNoun Top Down Parsing S Det Nominal Top Down Parsing S Det Nominal Top Down Parsing S Aux NP VP Top Down Parsing S Aux NP VP Top Down Parsing S VP Top Down Parsing S VP Verb Top Down Parsing S VP Verb book Top Down Parsing S VP Verb book X that Top Down Parsing S VP Verb NP Top Down Parsing S VP Verb NP book Top Down Parsing S VP Verb NP book Pronoun Top Down Parsing S VP Verb NP book Pronoun Top Down Parsing S VP Verb NP book ProperNoun Top Down Parsing S VP Verb NP book ProperNoun Top Down Parsing S VP Verb NP book Det Nominal Top Down Parsing S VP Verb NP book Det Nominal that Top Down Parsing S VP Verb NP book Det Nominal that Noun Top Down Parsing S VP Verb NP book Det Nominal that Noun flight Bottom Up Parsing book

Download Document

Here is the link to download the presentation.
"Parsing David Kauchak CS159 – Spring 2019 Admin"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.

Related Presentations

Basic Parsing with Context-Free Grammars Challenges to image parsing researchers Part C: Parsing the web and domain adaptation Part B: Semi-supervised dependency parsing for in-domain te 4. Parsing in Practice Parsing Bottom-Up Parsing Dependency Parsing Grammars David Kauchak CS159 – Spring 2019 NLP Linguistics 101 David Kauchak CS159 – Spring 2019 some slides adapted from Ray Mooney Grammars David Kauchak CS159 – Fall 2020 Grammars David Kauchak CS159 – Spring 2023 Top 6 Tips to Crack CWNP CWNA-109 Certification