(a) List the most important string processing functions we have used in the notes and give a one-sentence description in your own words for what it does
(b) give a small example demonstrating each function's use
(a) Explain the difference between Hamming and Levenshtein distance (also commonly called edit distance) metrics.
(b) demonstrate an example where the Hamming and Levenshtein distances are different for a pair of strings. You can use the nltk.metrics package.
List eight NLP tasks which we have covered in class including two relatively easy tasks and two very difficult tasks. Give your personal opinion on how they might be sorted in terms of easiest to most difficult to implement from scratch.