[('this', 2), ('absolutely', 1), ('amazing', 1), ('crazy', 1), ('movie', 2), ('what', 1), ('funniest', 1), ('year', 1)] Write a function named classify that takes this list as a parameter and returns a list of tuples grouped on word length, e.g.: [(4, [('this', 2), ('what', 1), ('year', 1)]). (5, [('crazy', 1), ('movie', 2)]), (7, [('amazing', 1)]), (8, [('funniest', 1)]), (10, [('absolutely', 1)])] Each tuple in the resulting list has a word length and a list of all words of that length, with their frequency counts. The list is sorted in ascending order of the word lengths, so the list of words of length 4 appears before the list of words of length 5, etc. Within each list of words of the same length, the words should appear in alphabetical order.

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
icon
Related questions
Question
Suppose we've parsed some input text to count the number of occurrences of each word and create a list of (word, count) such as the following:
[('this', 2), ('absolutely', 1), ('amazing', 1), ('crazy', 1), ('movie', 2),
('what', 1), ('funniest', 1), ('year', 1)]
Write a function named classify that takes this list as a parameter and returns a list of tuples grouped
on word length, e.g.:
[(4, [('this', 2), ('what', 1), ('year', 1)]),
(5, [('crazy', 1), ('movie', 2)]),
(7, [('amazing', 1)]),
(8, [('funniest', 1)]),
(10, [('absolutely', 1)])]
Each tuple in the resulting list has a word length and a list of all words of that length, with their
frequency counts. The list is sorted in ascending order of the word lengths, so the list of words of
length 4 appears before the list of words of length 5, etc. Within each list of words the same length,
the words should appear in alphabetical order.
Transcribed Image Text:[('this', 2), ('absolutely', 1), ('amazing', 1), ('crazy', 1), ('movie', 2), ('what', 1), ('funniest', 1), ('year', 1)] Write a function named classify that takes this list as a parameter and returns a list of tuples grouped on word length, e.g.: [(4, [('this', 2), ('what', 1), ('year', 1)]), (5, [('crazy', 1), ('movie', 2)]), (7, [('amazing', 1)]), (8, [('funniest', 1)]), (10, [('absolutely', 1)])] Each tuple in the resulting list has a word length and a list of all words of that length, with their frequency counts. The list is sorted in ascending order of the word lengths, so the list of words of length 4 appears before the list of words of length 5, etc. Within each list of words the same length, the words should appear in alphabetical order.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Declaring and Defining the Function
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education