An incremental interactive algorithm for regular grammar inference

Conference · Tue Dec 31 00:00:00 EST 1996

OSTI ID:430872

Parekh, R; Honavar, V ^[1]

---

1. Iowa State Univ., Ames, IA (United States)

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.

• OSTI ID: 430872
• Report Number(s): CONF-960876-; TRN: 96:006521-0249
• 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

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
ARTIFICIAL INTELLIGENCE
NATURAL LANGUAGE
ALGORITHMS
PATTERN RECOGNITION
LEARNING