Skip to the report

Pattern-Lang

Name · compose · verify

Recognize a pattern by parsing it into named primitives over a small finite lexicon, not by learning it from billions of examples.

lexicon 10 rules · used 0
every recognition is explicit and checkable, traceable to named rules