An incremental interactive algorithm for grammar inference

Download PDF
Open Webpage

Rajesh Parekh, Vasant G. Honavar

Published: 1996, Last Modified: 14 Sept 2025ICGI 1996EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly specifies a lattice of finite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG is identified by searching the version-space using membership queries. We explore the problem of regular grammar inference in a setting where positive examples are provided intermittently. We provide an incremental version of the algorithm along with a set of sufficient conditions for its convergence.