This is part of an ever-evolving collection of algorithmic solutions to programmatic quandaries.
The of and to. A in is I. That it, for you, was with on. As have ... but be they.
These are the most frequently used words in the English language, listed in descending order of popularity. This popularity also follows the logarithmic progression of Zipf's Law, which is explained very well by VSAUCE @ https://www.youtube.com/watch?v=fCn8zs912OE
The Token-Pattern-Detector will analyze the provided collection of strings, producing a manifest of each token found and their population count within. Given the ability to parse for spaces, or to blindly discover patterns in condensed strings, this may be used accross many applications.