We can consider the words in a file to be each word in a separate line..
And in the other file containing paragraphs , we can consider each paragraph as a single line.. Each paragraph starts with > symbol.. So we can consider the occurrence of > symbol to be the start of new para..
I already have a hash which stores both the information
a hash containing - which words are contained in a paragraph
another hash containing - which paragraphs contains which words..
The only challenge is to find the minimum set of paras that includes all the keywords.
Help is greatly appreciated.