matcher

Many string operations are useful as a general list operations as well, including regular expression matcher.

Can you make the matcher function in main.go go away with a simpler (more intuitive) interface/api/dsl?

In order to recall knowledge/experiences from memory quickly you have to be an expert pattern matcher.

It's hard enough as it is to replicate the best pattern matcher we've ever known, the human brain.

Also, it needs to recognize if multiple were matched, which is definitely not going to be done by the built-in regex matcher.

But your idea around using a regex style matcher should be good.

A simple color-matcher can be used to create very impressive things if plugged into a genetic algorithm, but no one claims it's conscious or intelligent.

Someone else already mentioned a Sublime Text like fuzzy matcher.

So you'd have to flash them briefly and ask for an instant answer or something, to catch the pattern matcher before the cognitive check got done?

Also, abstract says they did it by taking LZ4's matcher + Zlib's entropy encoder, so they can't be expected to outperform the LZ4 author's new work.

The human brain is the best pattern matcher in existence, lets use biomicry, like the human race has done in the past, to make brake throughs.

I've come across simian - isn't it a fuzzy matcher without semantic analysis?

Every log file "parser" I've seen was a heuristic matcher, and I've seem most all of them make mistakes.

"we propose a system that can attack a minutia-based fingerprint matcher" In this case, the attack algorithm is building an optimization to determine a viable template - using some prior information of what type of template is acceptable (how it's stored, the features being used to build it, etc.) In real life, this type of information is not readily available, and at best, an attacker is going to be just guessing.

"Many string operations are useful as a general list operations as well, including regular expression matcher." The way to get around that is to have some concept of interfaces in the language, and then have a generic Sequence type that strings, arrays, lists, and a bunch of other concrete types all implement.

"Many string operations are useful as a general list operations as well, including regular expression matcher." Except this falls apart when dealing with Unicode -- if your regex wants to match "ä", for example, treating strings as lists means you'll miss at least one possible way of representing that in Unicode (it may be a single code point, or it may be two -- an "a" with a combining diaresis).