On Learning Unions of Pattern Languages and Tree Patterns
نویسندگان
چکیده
منابع مشابه
Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
A tree pattern p is a first-order term in formal logic, and the language of p is the set of all the tree patterns obtainable by replacing each variable in p with a tree pattern containing no variables. We consider the inductive inference of the unions of these languages from positive examples using strategies that guarantee some forms of minimality during the learning process. By a result in ou...
متن کاملLearning Pattern Languages over Groups
This article studies the learnability of classes of pattern languages over automatic groups. It is shown that the class of bounded unions of pattern languages over any finitely generated Abelian automatic group is explanatorily learnable. Furthermore, patterns are considered in which variables occur at most n times. The classes of the languages generated by such patterns as well as the bounded ...
متن کاملA Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages
A tree pattern is a structured pattern known as a term in formal logic, and a tree pattern language is the set of trees which are the ground instances of a tree pattern. In this paper, we deal with the class of tree languages whose language is de ned as a union of at most k tree pattern languages, where k is an arbitrary xed positive number. In particular, we present a polynomial time algorithm...
متن کاملLearning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered tree pattern with internal structured variables, called a term tree, is a rooted tree pattern which consists of tree structures with ordered children and internal structured variables. A term tree is suited for repre...
متن کاملFinding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
A pattern is a string of constant symbols and variables. The language de ned by a pattern p is the set of constant strings obtained from p by substituting nonempty constant strings for variables in p. In this paper we are concerning with polynomial time inference from positive data of the class of unions of a bounded number of pattern languages. We introduce a syntactic notion of minimal multip...
متن کامل