A method for the inference of non-recursive finite-state grammars
Faculty of Computing, Health and Science
School of Computer and Information Science
A method is presented for the generation of non-recursive finite-state grammars (FSG 's) from a set of strings that the FSG's are required to be able to produce. The method generates compact FSG's having a near minimal number of rules and non-terminals, compatible with the requirement to be able to generate all the strings in the example set. This method produces grammars with a reasonable amount of compulation compared with enumerative methods.