how to write algorithm using psuedo-code for this :

Given an article such as this one at nytimes.com, design an algorithm to find the top 150 most frequently co-occurring word-pairs in this article. Two words are said to co-occur if they appear in the same sentence. For example, the last sentence in this article "It's really a milestone in Chinese science fiction." contain the following word pairs: ('It's', 'really') ('It's', 'a')('it's', 'milestone') (, 'Chinese') ('It's', 'science') ('It's', 'fiction') Creakily^, 'milestone')C really!.:, ^. 'science') (.'.really.', 'fictions'^', ' milestone')^, 'in'), 'Chinese') 'science')a', 'fiction')(milestone', milestone) ('a', in)('a' Chinese') ('a, science') (milestone' 'fiction') ('in', Chinese') ('in', science') ('in, fiction') ('Chinese, ' 'science') ('Chinese', 'fiction') ('science, ' 'fiction') you can assume you have access to a subroutine, sentenceSplitter(article), that can accurately segment an article into separate sentences and return these sentences in an array-like structure. You can also assume that you have access to another routine tokenizer(sentence), that can accurately identify the individual words contained in the input sentence and return these words in another array-like data structure