Learning DFA from correction and equivalence queries

Authors:
Leonor Becerra-Bonache;Adrian Horia Dediu;Cristina Tîrnăucă
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 5
Cited 18

Learning regular sets from queries and counterexamples

Information and Computation
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
A Rational Design for a Weighted Finite-State Transducer Library

WIA '97 Revised Papers from the Second International Workshop on Implementing Automata

One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
On Learning Regular Expressions and Patterns Via Membership and Correction Queries

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Note on the Relationship between Different Types of Correction Queries

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning Balls of Strings from Edit Corrections

The Journal of Machine Learning Research
USING GRAMMATICAL INFERENCE TECHNIQUES TO LEARN ONTOLOGIES THAT DESCRIBE THE STRUCTURE OF DOMAIN INSTANCES

Applied Artificial Intelligence
One-shot learners using negative counterexamples and nearest positive examples

Theoretical Computer Science
Necessary and sufficient conditions for learning with correction queries

Theoretical Computer Science
Experiments using Ostia for a language production task

CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
A characterization of the language classes learnable with correction queries

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
MAT learners for recognizable tree languages and tree series

Acta Cybernetica
Learning from a smarter teacher

IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Learning finite automata using label queries

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Types of trusted information that make DFA identification with correction queries feasible

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Learning regular tree languages from correction and equivalence queries

Journal of Automata, Languages and Combinatorics
Bio-inspired grammatical inference

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Towards a bio-computational model of natural language learning

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Temporal logic robot control based on automata learning of environmental dynamics

International Journal of Robotics Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In active learning, membership queries and equivalence que- ries have established themselves as the standard combination to be used. However, they are quite “unnatural” for real learning environments (membership queries are oversimplified and equivalence queries do not have a correspondence in a real life setting). Based on several linguistic arguments that support the presence of corrections in children's language acquisition, we propose another kind of query called correction query. We provide an algorithm that learns DFA using correction and equivalence queries in polynomial time. Despite the fact that the worst case complexity of our algorithm is not better than Angluin's algorithm, we show through a large number of experiments that the average number of queries is considerably reduced by using correction queries.