1. Write a MapReduce program to find the frequency of each letter, case insensitive, in any input user-specified files. For example, "The quick brown fox jumps over the lazy dog" as input should generate the following output (letter,count) pairs: (T, 2), (H, 1), (E, 3), etc.
2. Your program also must find the total count of letters, case insensitive, from the input. Generate one extra output pair whose key is the string "total" and whose value is the total count of all letters.
3. Test your program against the 3 attached input files.
4. The input and output will be read/written from/into HDFS.
5. Your program must consist of a single file, namely, LetterCount.java. Declare the mapper and reducer classes as inner classes.
This sounds good, I have a lot of experience with Spark so this would be easy. I am also new on this website so looking to increase my number of projects and reviews etc.
Hi sir, what program language should we use for this? They're all fine with me. Let's work together and I'll delivery this in less than 24hr with 100% efficiency. Cheers
Hi!
I have a rich experience in Mapreduce. Acutally, it was my thesis defence topic, and
I know exactly how to complete this task. I can explain thoroughly the details of the
solution. Looking forward working with you!
Best regards, Adai