Incremental learning of context free grammars by bridging rule generation and search for semi-optimum rule sets

  • Authors:

  • Katsuhiko Nakamura

  • Affiliations:

  • College of Science and Engineering, Tokyo Denki University, Hatoyama-machi, Saitama-ken, Japan

  • Venue:
  • ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes novel methods of learning general context free grammars from sample strings, which are implemented in Synapse system. Main features of the system are incremental learning, rule generation based on bottom-up parsing of positive samples, and search for rule sets. From the results of parsing, a rule generation process, called “bridging,” synthesizes the production rules that make up any lacking parts of an incomplete derivation tree for each positive string. To solve the fundamental problem of complexity for learning CFG, we employ methods of searching for non-minimum, semi-optimum sets of rules as well as incremental learning based on related grammars. One of the methods is search strategy called “serial search,” which finds additional rules for each positive sample and not to find the minimum rule set for all positive samples as in global search. The other methods are not to minimize nonterminal symbols in rule generation and to restrict the form of generated rules. The paper shows experimental results and compares various synthesis methods.