A memetic grammar inference algorithm for language learning

详细信息    查看全文

• 作者：Dejan Hrn?i?^a ; ^{dejan.hrncic@uni-mb.si} ; Marjan Mernik^a ; ^b ; Barrett R. Bryant^b ; Faizan Javed^c
• 关键词：Rule learning ; Incremental learning ; Unsupervised learning ; Grammatical inference ; Memetic algorithm ; Evolutionary computations
• 刊名：Applied Soft Computing Journal
• 出版年：2012
• 出版时间：March, 2012
• 年：2012
• 卷：12
• 期：3
• 页码：1006-1020
• 全文大小：1414 K

文摘

An unsupervised incremental algorithm for grammar inference and its application to domain-specific language development are described. Grammatical inference is the process of learning a grammar from the set of positive and optionally negative sentences. Learning general context-free grammars is still considered a hard problem in machine learning and is not completely solved yet. The main contribution of the paper is a newly developed memetic algorithm, which is a population-based evolutionary algorithm enhanced with local search and a generalization process. The learning process is incremental since a new grammar is obtained from the current grammar and false negative samples, which are not parsed by the current grammar. Despite being incremental, the learning process is not sensitive to the order of samples. All important parts of this algorithm are explained and discussed. Finally, a case study of a domain specific language for rendering graphical objects is used to show the applicability of this approach.