Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Recent advances of grammatical inference
Theoretical Computer Science - Special issue on algorithmic learning theory
Inference of Reversible Languages
Journal of the ACM (JACM)
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm
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
Incremental Learning of Context Free Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
GA-based Learning of Context-Free Grammars using Tabular Representations
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
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
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Grammatical Inference in Bioinformatics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Static and dynamic abstract formal models for 3D sensor images
WSEAS TRANSACTIONS on SYSTEMS
A perception oriented formal model for 3D sensor depth images
ICS'08 Proceedings of the 12th WSEAS international conference on Systems
Learning context-free grammar using improved tabular representation
Applied Soft Computing
Language structure using fuzzy similarity
IEEE Transactions on Fuzzy Systems
Learning to recognize video-based spatiotemporal events
IEEE Transactions on Intelligent Transportation Systems
Simplifying amino acid alphabets using a genetic algorithm and sequence alignment
EvoBIO'07 Proceedings of the 5th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
A local search algorithm for grammatical inference
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Grammar inference technology applications in software engineering
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Towards 3D modeling of interacting TM helix pairs based on classification of helix pair sequence
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
A memetic grammar inference algorithm for language learning
Applied Soft Computing
Automatic extractive text summarization based on fuzzy logic: a sentence oriented approach
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Using grammars for pattern recognition in images: A systematic review
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
We present a novel algorithm using new hypothesis representations for learning context-free grammars from a finite set of positive and negative examples. We propose an efficient hypothesis representation method which consists of a table-like data structure similar to the parse table used in efficient parsing algorithms for context-free grammars such as Cocke-Younger-Kasami algorithm. By employing this representation method, the problem of learning context-free grammars from examples can be reduced to the problem of partitioning the set of nonterminals. We use genetic algorithms for solving this partitioning problem. Further, we incorporate partially structured examples to improve the efficiency of our learning algorithm, where a structured example is represented by a string with some parentheses inserted to indicate the shape of the derivation tree of the unknown grammar. We demonstrate some experimental results using these algorithms and theoretically analyse the completeness of the search space using the tabular method for context-free grammars.