A Polynomial Time Incremental Algorithm for Regular Grammar Inference

International Colloquium on Grammatical Inference(1997)

引用 33|浏览51
暂无评分
摘要
We present an efficient incremental algorithm for learning regular grammarsfrom labeled examples and membership queries. This algorithm is an extension ofAngluin's ID procedure to an incremental framework. The learning algorithm isintermittently provided with labeled examples and has access to a knowledgeableteacher capable of answering membership queries. Based on the observed examplesand the teacher's responses to membership queries, the learner constructs a deterministicfinite...
更多
查看译文
关键词
polynomial time,active learning,machine learning,language learning,finite state automata
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要