Finally, we will do some simple analysis - ranking of words. Write a function word_ranking (corpus, n, sort_index) which takes input parameters corpus (type list), n (type int), and sort_index (type int) and returns a list containing tuples of words and their frequencies in the top n of words. Here, corpus is a list of sentences. n is the number of ranked words to return. The resulting list should then be sorted based on the sort_index; sort_index = should sort the list of tuples in ascending alphabetical order, while sort_index = 1 should sort the list of tuples by
Finally, we will do some simple analysis - ranking of words. Write a function word_ranking (corpus, n, sort_index) which takes input parameters corpus (type list), n (type int), and sort_index (type int) and returns a list containing tuples of words and their frequencies in the top n of words. Here, corpus is a list of sentences. n is the number of ranked words to return. The resulting list should then be sorted based on the sort_index; sort_index = should sort the list of tuples in ascending alphabetical order, while sort_index = 1 should sort the list of tuples by
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Finally, we will do some simple analysis - ranking of words. Write a
function word_ranking(corpus, n, sort_index) which takes input
parameters corpus (type list), n (type int), and sort_index (type int) and
returns a list containing tuples of words and their frequencies in the top
n of words. Here, corpus is a list of sentences. n is the number of ranked
words to return. The resulting list should then be sorted based on the
sort_index; sort_index = should sort the list of tuples in ascending
alphabetical order, while sort_index = 1 should sort the list of tuples by
the frequencies in descending order. All other numeric values for
sort_index should return an empty list (don't need to consider non-
integer inputs). For example, we have:
corpus = ['hi hi hi hi', 'hello hello say bye', 'bye bye']
n = 3
sort_index = 1
The function should return:
[('hi', 4), ('bye', 3), ('hello', 2)]
While sort_index = 0 should return:
[('bye', 3), ('hello', 2), ('hi', 4)]
You can assume n would be selected such that exactly n ranked words
will be matched.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fea0b1f8a-63ea-4896-a7a1-0b6830f20fb1%2Fcaa464aa-7231-422d-b734-c42daf5cc9fa%2Fb53i1e_processed.png&w=3840&q=75)
Transcribed Image Text:Finally, we will do some simple analysis - ranking of words. Write a
function word_ranking(corpus, n, sort_index) which takes input
parameters corpus (type list), n (type int), and sort_index (type int) and
returns a list containing tuples of words and their frequencies in the top
n of words. Here, corpus is a list of sentences. n is the number of ranked
words to return. The resulting list should then be sorted based on the
sort_index; sort_index = should sort the list of tuples in ascending
alphabetical order, while sort_index = 1 should sort the list of tuples by
the frequencies in descending order. All other numeric values for
sort_index should return an empty list (don't need to consider non-
integer inputs). For example, we have:
corpus = ['hi hi hi hi', 'hello hello say bye', 'bye bye']
n = 3
sort_index = 1
The function should return:
[('hi', 4), ('bye', 3), ('hello', 2)]
While sort_index = 0 should return:
[('bye', 3), ('hello', 2), ('hi', 4)]
You can assume n would be selected such that exactly n ranked words
will be matched.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY