| Creator |
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
This paper studies the learning complexity of classes of structured patterns for HTML/ XML-trees in the query learning framework of Angluin. We present polynomial time learning algorithms for ordered ...gapped tree patterns, OGT, and ordered gapped forests, OGF, under the into-matching semantics using equivalence queries and subset queries. As a corollary, the learnability with equivalence and membership queries is also presented. This work extends the recent results on the query learning for ordered forests under onto-matching semantics by Arimura et al. (1997), for unordered forests under into-matching semantics by Amoth, Cull, Tadepalli (1999), and for regular string patterns by Matsumoto and Shinohara (1997).show more
|
Export Mendeley
trcs191.ps
trcs191