Here's an application of this algorithm to AI. Say I have deduction (text
rewriting) examples like this:
revealing secret opening preparation => he reveals his secret opening
preparation
(Simple example of interpreting a video title into a sentence.) Then the
compression algorithm is able to split this automatically:
reveal|ing |secret opening preparation => he |reveal|s his |secret opening
preparation
Thus it neatly shows which words, parts of words ("reveal") and phrases
("secret opening preparation") occur on both the left-hand and right-hand side.
This information helps greatly in generalizing the example to a rule (which is
a core concept of my AI).
And all this with a linear-time algorithm! No lengthy searches for structures
at all - they just... *reveal* themselves as the algorithm scans over the input
once.
------------------------------------------
Artificial General Intelligence List: AGI
Permalink:
https://agi.topicbox.com/groups/agi/Tb2cf064c700f181c-M38a2e26cf7a56942c98f2f78
Delivery options: https://agi.topicbox.com/groups/agi/subscription
