eg-GRIDS: Context-free grammatical inference from positive examples using genetic search

18Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present eg-GRIDS, an algorithm for inducing context-free grammars that is able to learn from positive sample sentences. The presented algorithm, similar to its GRIDS predecessors, uses simplicity as a criterion for directing inference, and a set of operators for exploring the search space. In addition to the basic beam search strategy of GRIDS, eg-GRIDS incorporates an evolutionary grammar selection process, aiming to explore a larger part of the search space. Evaluation results are presented on artificially generated data, comparing the performance of beam search and genetic search. These results show that genetic search performs better than beam search while being significantly more efficient computationally. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Petasis, G., Paliouras, G., Spyropoulos, C. D., & Halatsis, C. (2004). eg-GRIDS: Context-free grammatical inference from positive examples using genetic search. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3264, pp. 223–234). Springer Verlag. https://doi.org/10.1007/978-3-540-30195-0_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free