Answered: S PP VP VP VP VP P ↑ NP VP P NP VP NP…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Consider the following simple Probabilistic Context-Free Grammar (PCFG), which we will use to parse the sentence “student types program with keyboard”.

. Find each of the possible parses of the sentence using the grammar, and draw the parse tree for each of these parses. Show the probability at each node.

b. For each parse, calculate its probability, which will be the product of the probabilities for all the rules used in generating it. Which one is the most probable and the most likely parse for a human reader?

S
P
PP
VP
VP
VP
VP
P
↑↑
↑↑↑↑↑
NP VP
P NP
VP NP
VP PP
types
program
with
1.0
1.0
0.3
0.3
0.15
0.25
1.0
NP →>>
NP →>
NP →>>
NP →>>
NP →>>
NP →>>
NP PP
NP NP
student
types
program
keyboard.
0.25
0.2
0.2
0.07
0.14
0.14

Expert Solution

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions