
doi: 10.1007/bfb0020409
In this paper, genetic algorithms have been shown to be a useful tool for the induction of context-free grammars from positive and negative examples of a language. Grammars for the language of correct parentheses expressions, for the language of equal numbers of a's and b's, for several regular languages, and for a small natural language subset have been inferred more or less correctly. Further experimentation will have to show whether this technique is applicable to more complex languages.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
