Question 5 Given a text file as input, create a map-reduce program that computes the number of words belonging to each of the following categories: • Palindromes (words spelled the same forward and backward, e.g., "pop" or "madam") • Words beginning with a vowel (A, E, I, O, or U) • All words. You may assume that each input record corresponds to one line of text, and the words have already been split (tokenized) into an array of strings. The output of your program should be a collection of category, #words tuples representing for each word category how many words were observed in the input. Note that the categories may overlap! the spaces below to implement your mapper reducer functions in pseudocode: Python syntax is not necessary. <

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

Please check the image for instructions. Thank you!

Question 5
Given a text file as input, create a map-reduce program that computes the number of words
belonging to each of the following categories:
Palindromes (words spelled the same forward and backward, e.g., "pop" or "madam")
• Words beginning with a vowel (A, E, I, O, or U)
All words.
You may assume that each input record corresponds to one line of text, and the words have
already been split (tokenized) into an array of strings. The output of your program should be a
collection of category, #words tuples representing for each word category how many words
were observed in the input. Note that the categories may overlap!
Use the spaces below to implement your mapper and reducer functions in pseudocode:
Python syntax is not necessary.
A
Transcribed Image Text:Question 5 Given a text file as input, create a map-reduce program that computes the number of words belonging to each of the following categories: Palindromes (words spelled the same forward and backward, e.g., "pop" or "madam") • Words beginning with a vowel (A, E, I, O, or U) All words. You may assume that each input record corresponds to one line of text, and the words have already been split (tokenized) into an array of strings. The output of your program should be a collection of category, #words tuples representing for each word category how many words were observed in the input. Note that the categories may overlap! Use the spaces below to implement your mapper and reducer functions in pseudocode: Python syntax is not necessary. A
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Operations of Linked List
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
  • SEE MORE 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