Inducing grammars from sparse data sets: a survey of algorithms and results

Authors:
Orlando Cicchello;Stefan C. Kremer
Affiliations:
Department of Computing and Information Science, University of Guelph, Guelph, ON, Canada;Department of Computing and Information Science, University of Guelph, Guelph, ON, Canada
Venue:
The Journal of Machine Learning Research
Year:
2003

Citing 14
Cited 19

The Induction of Dynamical Recognizers

Machine Learning - Connectionist approaches to language learning
Random DFA's can be approximately learned from sparse uniform examples

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient learning of typical finite automata from random walks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Learning the initial state of a second-order recurrent neural network during regular-language inference

Neural Computation
A new algorithm for the reduction of incompletely specified finite state machines

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
A sampling-based heuristic for tree search applied to grammar induction

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
A Stochastic Search Approach to Grammar Induction

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Beyond EDSM

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: the GIG Method

ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Limits of Exact Algorithms For Inference of Minimum Size Finite State Machines

ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Formal languages and their relation to automata

Formal languages and their relation to automata

Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Inferring context-free grammars for domain-specific languages

OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Inferring context-free grammars for domain-specific languages

OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review

Neural Computation
Active Coevolutionary Learning of Deterministic Finite Automata

The Journal of Machine Learning Research
Learning DFA representations of HTTP for protecting web applications

Computer Networks: The International Journal of Computer and Telecommunications Networking
Learning indexed families of recursive languages from positive data: A survey

Theoretical Computer Science
Automatic generation of software behavioral models

Proceedings of the 30th international conference on Software engineering
Learning Commutative Regular Languages

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Grammatical inference for robotic self-assembly: basic methodology

AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Grammatical inference methodology for control systems

WSEAS Transactions on Computers
Intelligent Processing of an Unrestricted Text in First Order String Calculus

Transactions on Computational Science V
Minimal finite automata from finite training sets

Proceedings of the 46th Annual Southeast Regional Conference on XX
Towards learning stochastic logic programs from proof-banks

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A Technique for Verifying Component-Based Software

Electronic Notes in Theoretical Computer Science (ENTCS)
Collaborative learning agents supporting service network management

SOCASE'08 Proceedings of the 2008 AAMAS international conference on Service-oriented computing: agents, semantics, and engineering
SSGL: a semi-supervised grammar learner

International Journal of Computer Applications in Technology
Incrementally discovering testable specifications from program executions

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Learning web application firewall - benefits and caveats

ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a comprehensive survey of the field of grammar induction applied to randomly generated languages using sparse example sets.