Inference of regular grammars via skeletons
IEEE Transactions on Systems, Man and Cybernetics
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Polynomial-time learning of very simple grammars from positive data
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Efficient learning of context-free grammars from positive structural examples
Information and Computation
The inference of tree languages from finite samples: an algebraic approach
Theoretical Computer Science
Learning approximately regular languages with reversible languages
Theoretical Computer Science
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Inference of Reversible Languages
Journal of the ACM (JACM)
The use of grammatical inference for designing programming languages
Communications of the ACM
Error-correcting tree language inference
Pattern Recognition Letters
Probabilistic k-Testable Tree Languages
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Context-Free Grammars from Partially Structured Examples
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
A note on grammatical inference of slender context-free languages
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Current Trends in Grammatical Inference
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Approximative Learning of Regular Languages
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
On Learning Systolic Languages
ALT '92 Proceedings of the Third Workshop on Algorithmic Learning Theory
How to Invent Characterizable Inference Methods for Regular Languages
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Learning context-free languages from their structured sentences
ACM SIGACT News
Algorithms for Learning Function Distinguishable Regular Languages
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
LARS: A learning algorithm for rewriting systems
Machine Learning
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A bibliographical study of grammatical inference
Pattern Recognition
DLT'03 Proceedings of the 7th international conference on Developments in language theory
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
| Hi-index | 0.00 |
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced in our ALT 2000 paper is generalizable from the case of string languages towards tree languages, hence providing a large source of identifiable classes of regular tree languages. Eachof these classes can be characterized in various ways. Moreover, we present a generic inference algorithm with polynomial update time and prove its correctness. In this way, we generalize previous works of Angluin, Sakakibara and ourselves. Moreover, we show that this way all regular tree languages can be identified approximately.