An incremental interactive algorithm for regular grammar inference

Rajesh Parekh, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 Mc 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.

Original languageEnglish (US)
Title of host publicationGrammatical Inference
Subtitle of host publicationLearning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings
EditorsColin de la Higuera, Laurent Miclet
PublisherSpringer Verlag
Pages238-249
Number of pages12
ISBN (Print)3540617787, 9783540617785
DOIs
StatePublished - Jan 1 1996
Event3rd International Colloquium on Grammatical Inference, ICGI 1996 - Montpellier, France
Duration: Sep 25 1996Sep 27 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1147
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Colloquium on Grammatical Inference, ICGI 1996
CountryFrance
CityMontpellier
Period9/25/969/27/96

Fingerprint

Finite automata
Grammar
Finite State Automata
Query
Strings
Target
Sufficient Conditions

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Parekh, R., & Honavar, V. (1996). An incremental interactive algorithm for regular grammar inference. In C. de la Higuera, & L. Miclet (Eds.), Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings (pp. 238-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1147). Springer Verlag. https://doi.org/10.1007/BFb0033358
Parekh, Rajesh ; Honavar, Vasant. / An incremental interactive algorithm for regular grammar inference. Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. editor / Colin de la Higuera ; Laurent Miclet. Springer Verlag, 1996. pp. 238-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{24c1f44f1082440eacc7447547f36513,
title = "An incremental interactive algorithm for regular grammar inference",
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 Mc 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.",
author = "Rajesh Parekh and Vasant Honavar",
year = "1996",
month = "1",
day = "1",
doi = "10.1007/BFb0033358",
language = "English (US)",
isbn = "3540617787",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "238--249",
editor = "{de la Higuera}, Colin and Laurent Miclet",
booktitle = "Grammatical Inference",
address = "Germany",

}

Parekh, R & Honavar, V 1996, An incremental interactive algorithm for regular grammar inference. in C de la Higuera & L Miclet (eds), Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1147, Springer Verlag, pp. 238-249, 3rd International Colloquium on Grammatical Inference, ICGI 1996, Montpellier, France, 9/25/96. https://doi.org/10.1007/BFb0033358

An incremental interactive algorithm for regular grammar inference. / Parekh, Rajesh; Honavar, Vasant.

Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. ed. / Colin de la Higuera; Laurent Miclet. Springer Verlag, 1996. p. 238-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1147).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An incremental interactive algorithm for regular grammar inference

AU - Parekh, Rajesh

AU - Honavar, Vasant

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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 Mc 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.

AB - 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 Mc 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.

UR - http://www.scopus.com/inward/record.url?scp=84958968064&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958968064&partnerID=8YFLogxK

U2 - 10.1007/BFb0033358

DO - 10.1007/BFb0033358

M3 - Conference contribution

AN - SCOPUS:84958968064

SN - 3540617787

SN - 9783540617785

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 238

EP - 249

BT - Grammatical Inference

A2 - de la Higuera, Colin

A2 - Miclet, Laurent

PB - Springer Verlag

ER -

Parekh R, Honavar V. An incremental interactive algorithm for regular grammar inference. In de la Higuera C, Miclet L, editors, Grammatical Inference: Learning Syntax from Sentences - 3rd International Colloquium, ICGI-1996, Proceedings. Springer Verlag. 1996. p. 238-249. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0033358