An incremental interactive algorithm for regular grammar inference
Abstract
Grammar inference, a problem with many applications in pattern recognition and language learning, is defined as follows: For an unknown grammar G, given a finite set of positive examples S{sup +} that belong to L(G), and possibly a finite set of negative examples S{sup -}, infer a grammar G* equivalent to G. Different restrictions on S{sup +} and S{sup -} and the interaction of the learner with the teacher or the environment give rise to different variants of this task. We present an interactive incremental algorithm for inference of a finite state automaton (FSA) corresponding to an unknown regular grammar.
- Authors:
-
- Iowa State Univ., Ames, IA (United States)
- Publication Date:
- OSTI Identifier:
- 430872
- Report Number(s):
- CONF-960876-
TRN: 96:006521-0249
- Resource Type:
- Conference
- Resource Relation:
- Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; ARTIFICIAL INTELLIGENCE; NATURAL LANGUAGE; ALGORITHMS; PATTERN RECOGNITION; LEARNING
Citation Formats
Parekh, R, and Honavar, V. An incremental interactive algorithm for regular grammar inference. United States: N. p., 1996.
Web.
Parekh, R, & Honavar, V. An incremental interactive algorithm for regular grammar inference. United States.
Parekh, R, and Honavar, V. 1996.
"An incremental interactive algorithm for regular grammar inference". United States.
@article{osti_430872,
title = {An incremental interactive algorithm for regular grammar inference},
author = {Parekh, R and Honavar, V},
abstractNote = {Grammar inference, a problem with many applications in pattern recognition and language learning, is defined as follows: For an unknown grammar G, given a finite set of positive examples S{sup +} that belong to L(G), and possibly a finite set of negative examples S{sup -}, infer a grammar G* equivalent to G. Different restrictions on S{sup +} and S{sup -} and the interaction of the learner with the teacher or the environment give rise to different variants of this task. We present an interactive incremental algorithm for inference of a finite state automaton (FSA) corresponding to an unknown regular grammar.},
doi = {},
url = {https://www.osti.gov/biblio/430872},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Dec 31 00:00:00 EST 1996},
month = {Tue Dec 31 00:00:00 EST 1996}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.