Part of the 'foundations' of the SP Computer Model (see details below) is a process for finding 'good' full and partial matches between patterns, where 'good' is defined in terms of information compression.
That process of finding good full and partial matches between patterns is similar to the way in which searching via Google finds good full and partial matches between the query pattern and patterns on the internet. But searching in Google has the power of many computers behind it.
So if the pattern-matching processes in the SP Computer Model could be replaced by the high-powered pattern-matching processes in Google, or other search engine, there is potential to create a system with the power of Google (or other search engine) together with the versatility and intelligence of the SP Computer Model. And there is potential for much more of that versatility and intelligence as the SP Computer Model is further developed (see "A roadmap for the development of the 'SP Machine' for artificial intelligence" (V. Palade and J G Wolff, The Computer Journal, Advance article, 2019, bit.ly/2Vu0M9Q)).
It would be good to see this set up and working. Anything you (the reader) can do to make that happen would be very welcome. Please let us know via the contact details under 'Contacts' on the left.
An outline of the SP System, meaning the SP Theory of Intelligence and its realisation in the SP Computer Model, may be found in Section 2.2 of "Information compression as a unifying principle in human learning, perception, and cognition" (PDF, Complexity, vol. 2019, Article ID 1879746, 38 pages, 2019, https://doi.org/10.1155/2019/1879746), and in appendices to most of the other published papers for which details are provided on http://www.cognitionresearch.org/sp.htm. All of those sources contain pointers to where fuller information may be found.