Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
Inference of Reversible Languages
Journal of the ACM (JACM)
Machine Learning
Machine Learning
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Learning A Class of Regular Expressions via Restricted Subset Queries
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
Learning Balls of Strings with Correction Queries
ECML '07 Proceedings of the 18th European conference on Machine Learning
Learning regular tree languages from correction and equivalence queries
Journal of Automata, Languages and Combinatorics
Algorithms for learning regular expressions
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learning DFA from correction and equivalence queries
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning Balls of Strings from Edit Corrections
The Journal of Machine Learning Research
Learning regular expressions from representative examples and membership queries
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Learning regular expressions to template-based FAQ retrieval systems
Knowledge-Based Systems
| Hi-index | 0.00 |
Based on the ideas suggested in [5], the following model for learning from a variant of correctionqueries to an oracle is proposed: being asked a membership query, the oracle, in the case of negative answer, returns also a correction--- a positive datum (that has not been seen in the learning process yet) with the smallest edit distance from the queried string. Polynomial-time algorithms for learning a class of regular expressions from one such query and membership queries and learning pattern languages from queries of this type are proposed and discussed.