Please use this identifier to cite or link to this item:
Title: Search diversification techniques for grammatical inference
Authors: Spina, Sandro
Keywords: Induction (Mathematics) -- Computer programs
Lattice theory
Issue Date: 2005
Publisher: University of Malta. Faculty of ICT
Citation: Spina, S. (2005). Search diversification techniques for grammatical inference. 3rd Computer Science Annual Workshop (CSAW’05), Kalkara. 62-66.
Abstract: Grammatical Inference (GI) addresses the problem of learning a grammar G, from a finite set of strings generated by G. By using GI techniques we want to be able to learn relations between syntactically structured sequences. This process of inferring the target grammar G can easily be posed as a search problem through a lattice of possible solutions. The vast majority of research being carried out in this area focuses on non-monotonic searches, i.e. use the same heuristic function to perform a depth first search into the lattice until a hypothesis is chosen. EDSM and S-EDSM are prime examples of this technique. In this paper we discuss the introduction of diversification into our search space [5]. By introducing diversification through pairwise incompatible merges, we traverse multiple disjoint paths in the search lattice and obtain better results for the inference process.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
Proceedings of CSAW’05 - A9.pdf210.47 kBAdobe PDFView/Open

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.