Precedence-inclusion patterns generalize constituent structure trees familiar to computational linguists. By small changes in the axioms, we obtain (1) structures supporting a significant theory of pattern generalization that directly speaks to the problem of relational learning in many settings, (2) when specialized to posets, a new theory of poset generalization that may support generalization of ontologies and hierarchical classification systems, and (3) a rich extension of the category of sets.
By: Frank J. Oles
Published in: RC22622 in 2002
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .