Woah. That is very helpful. Can you tell me what it score [without Indirect] and only using SSE and MATCH and 4 orders (or up to 15 orders if it improves compression) ?
And another question, it seems like the what you ran with ISSE and ICM and 4 orders and MATCH is most of the algorithm and you said it scored 22917, but what is the score with that + gaps? Is it ~20,000 bytes then I guess? (Like when you ran in a few days ago?). And what else is there in your algorithm (if adding gaps to those settings above doesn't bring it to ~20,000) that brings the rest of it down to ~20,000? (you said it scored that a few days ago) --------------------------------------------------------------------------------------------- Btw mine makes MATCH and SSE but they are the same thing (and I think I do it a different way and I use how far back they are in the last ~500 characters (and of course how many times appear) to tally up the SSE score for each character). I do about 4 MATCHES for 4 orders. This is my SSE. But I also do it to order 0 (the character "is" the MATCH) and order 1 (of the 2 characters for order 1, only one character seeks a MATCH, but I also do 2 character MATCH for order 1 in another loop over order 1, but not for higher orders (it didn't help at 100,000 bytes of data, at least, I mean)). ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Tf0bedfcd44454678-Mfaaa9deb53800cafaeeca28c Delivery options: https://agi.topicbox.com/groups/agi/subscription
