Elements of information theory
Elements of information theory
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Computing the relative entropy between regular tree languages
Information Processing Letters
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
Hidden Markov Model} Induction by Bayesian Model Merging
Advances in Neural Information Processing Systems 5, [NIPS Conference]
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Generalized Stochastic Tree Automata for Multi-relational Data Mining
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Tree k-Grammar Models for Natural Language Modelling and Parsing
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parsing with Probabilistic Strictly Locally Testable Tree Languages
IEEE Transactions on Pattern Analysis and Machine Intelligence
LARS: A learning algorithm for rewriting systems
Machine Learning
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
Fundamenta Informaticae
Learning Rational Stochastic Tree Languages
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
An Inductive Logic Programming Approach to Statistical Relational Learning
Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning
Journal of Artificial Intelligence Research
Learning context-free grammar using improved tabular representation
Applied Soft Computing
A bibliographical study of grammatical inference
Pattern Recognition
Smoothing and compression with stochastic k-testable tree languages
Pattern Recognition
A spectral approach for probabilistic grammatical inference on trees
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Learning multiplicity tree automata
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning Probabilistic Systems from Tree Samples
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition
Fundamenta Informaticae
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
| Hi-index | 0.00 |
We generalize a former algorithm for regular language identification from stochastic samples to the case of tree languages. It can also be used to identify context-free languages when structural information about the strings is available. The procedure identifies equivalent subtrees in the sample and outputs the hypothesis in linear time with the number of examples. The results are evaluated with a method that computes efficiently the relative entropy between the target grammar and the inferred one.