Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

First, write a regular expression that captures the following requirement: a noun phrase is a sequence of one or more nouns (which are denoted with

First, write a regular expression that captures the following requirement: a noun phrase is a sequence of one or more nouns (which are denoted with the letter N) preceded by zero, one or more adjectives (which are denoted with the letter J). (remember to handle changes in capitalization)
Then, use this regular expression to produce a list of lists of tuples, where each inner tuple contains the start and end position (note that end position is non inclusive) of each noun phrase your regex found. For example, for the third sentence, the corresponding list of tuples could be [(2, 3), (4, 5 )], because it found two different noun phrases (in the form of tuples):
(rabbit,)
Page 7
Page 8
(hole,)
Implement this functionality in the find_positions(tags_sequences) function, which will take as
input the tags_sequences variable from the previous step.

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

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2010 Barcelona Spain September 2010 Proceedings Part 3 Lnai 6323

Authors: Jose L. Balcazar ,Francesco Bonchi ,Aristides Gionis ,Michele Sebag

2010th Edition

3642159389, 978-3642159381

More Books

Students also viewed these Databases questions