Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I need to parse a sentence using these rules S VP S VP NP S NP VP VP Verb NP VP Verb NP (PP*) VP

I need to parse a sentence using these rules S VP

S VP NP

S NP VP

VP Verb NP

VP Verb NP (PP*)

VP VP PP

VP VP CC VP

VP Verb

VP Verb VP

NP Noun NP

NP NP PP

NP NP CC NP

NP Det Adj Noun |

Det Noun (PP)

NP Det Noun

NP (Art) (Adj) Noun

PP Prep NP

CC Conjunction this is the code I did but I got no output import nltk

grammar = nltk.CFG.fromstring(""" S -> NP VP NP -> N NP | Adj VP -> Verb VP | Verb NP Adj -> 'visiting' | 'tiresome' N -> 'relatives' V -> 'can' | 'be' """)

sent = ['visiting', 'relatives', 'can', 'be', 'tiresome'] parser = nltk.ChartParser(grammar) for tree in parser.parse(sent): print(tree)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Management Systems Designing And Building Business Applications

Authors: Gerald V. Post

1st Edition

0072898933, 978-0072898934

More Books

Students also viewed these Databases questions

Question

manageremployee relationship deteriorating over time;

Answered: 1 week ago