Learning Algorithms for Grammars of Variable Arity Trees
"Learning Algorithms for Grammars of..." refers background or methods or result in this paper
...XML Schema in terms of power and that regular tree grammar was similar in power to the Relax NG. The inferred grammars were later validated against the input samples using an algorithm given by [ 6 ] and it was found that all samples were validated, further showing the accuracy of the inferred grammar....
...In this paper we show how local, single type as well as regular tree grammars[ 6 ] can be inferred from a set of positive samples of trees having variable arity....
...Variable arity trees can be generated using special types of grammars [ 6 ]....
...This is also in agreement with the claims made in [ 6 ] that singletype grammar corresponded to the...
...This supports the claim made in [ 6 ] that local tree grammars are similar in power to the DTDs....
"Learning Algorithms for Grammars of..." refers methods in this paper
...Other regular expression inference algorithm would also work in its place, such as XTRACT [ 4 ] and ....