Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Theoretical Computer Science
A Polynomial time Algorithm for the Local Testability Problem of Deterministic Finite Automata
IEEE Transactions on Computers
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Incremental concept learning for bounded data mining
Information and Computation
Journal of the ACM (JACM)
Families of locally testable languages
Theoretical Computer Science
Learning k-piecewise testable languages from positive data
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
The Product of Rational Languages
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Identification of function distinguishable languages
Theoretical Computer Science
A study of grammatical inference
A study of grammatical inference
Text classification using string kernels
The Journal of Machine Learning Research
The Journal of Machine Learning Research
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
Some natural conditions on incremental learning
Information and Computation
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Kernel methods for learning languages
Theoretical Computer Science
Parallelism Increases Iterative Learning Power
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Estimating strictly piecewise distributions
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
On languages piecewise testable in the strict sense
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Journal of Logic, Language and Information
Languages as hyperplanes: grammatical inference with string kernels
ECML'06 Proceedings of the 17th European conference on Machine Learning
Planar languages and learnability
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
String extension learning using lattices
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Tier-based strictly local constraints for phonology
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
Temporal logic robot control based on automata learning of environmental dynamics
International Journal of Robotics Research
| Hi-index | 0.00 |
This paper provides a unified, learning-theoretic analysis of several learnable classes of languages discussed previously in the literature. The analysis shows that for these classes an incremental, globally consistent, locally conservative, set-driven learner always exists. Additionally, the analysis provides a recipe for constructing new learnable classes. Potential applications include learnable models for aspects of natural language and cognition.