A pumping lemma for deterministic context-free languages
Information Processing Letters
Dynamic parsers and evolving grammars
ACM SIGPLAN Notices
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Natural Language Grammatical Inference with Recurrent Neural Networks
IEEE Transactions on Knowledge and Data Engineering
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
Current Trends in Grammatical Inference
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Grammatical Inference in Bioinformatics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning context-free grammars using tabular representations
Pattern Recognition
Evolutionary induction of stochastic context free grammars
Pattern Recognition
Hi-index | 0.10 |
In this paper, we propose an approach to quantitative structural information for inferring context free grammars. First, we construct derivative capacity of nonterminal symbols in context free grammar, concomitant indicator and embedded dimensional number of strings in samples set, which are called as quantitative structural information; then, we rewrite Cocke-Younger-Kasami (CYK) algorithm for parsing in the form of the derivative set; third, we present the construction of new production rule and the descriptive procedure for inferring with an extended CYK algorithm by the quantitative structural information. Finally, we discuss the extended CYK algorithm for inferring context free grammars.