For this , the goal is to find lexical items D that increase the intensity of a very restricted group of lexical items E that they modify, often to the extreme, such as pitch black, dead center, deathly sick, stark contrast, and so on. In particular, your task is to list as many pairs of such D and E as possible in an automated manner, ranking the output in a descending order of how restrictive such pairing is. As before, you may choose your own text corpora, but use techniques that can be implemented in Python and NLTK. You should not include any specific clause for particular lexical items, such as dead or center, in your program.
A Write a Python code to access some text corpora and to output ranked expressions.
B Include the first 100 expressions in a descending order of uniqueness for such pairing.
Discuss your results, to argue why they are reasonably ranked, and to suggest how you can improve the quality of the results further
