Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

Bibliographic Information

Other Title
  • 構文解析にもとづく規則生成と規則集合探索による文脈自由文法の漸次学習
  • コウブン カイセキ ニ モトヅク キソク セイセイ ト キソク シュウゴウ タンサク ニ ヨル ブンミャク ジユウ ブンポウ ノ ゼンジ ガクシュウ

Search this article


This paper discusses recent improvements and extensions in Synapse system for inductive inference of context free grammars (CFGs) from sample strings. Synapse uses incremental learning, rule generation based on bottom-up parsing, and the search for rule sets. The form of production rules in the previous system is extended from Revised Chomsky Normal Form A→βγ to Extended Chomsky Normal Form, which also includes AB, where each of β and γ is either a terminal or nonterminal symbol. From the result of bottom-up parsing, a rule generation mechanism synthesizes minimum production rules required for parsing positive samples. Instead of inductive CYK algorithm in the previous version of Synapse, the improved version uses a novel rule generation method, called ``bridging,'' which bridges the lacked part of the derivation tree for the positive string. The improved version also employs a novel search strategy, called serial search in addition to minimum rule set search. The synthesis of grammars by the serial search is faster than the minimum set search in most cases. On the other hand, the size of the generated CFGs is generally larger than that by the minimum set search, and the system can find no appropriate grammar for some CFL by the serial search. The paper shows experimental results of incremental learning of several fundamental CFGs and compares the methods of rule generation and search strategies.


Citations (1)*help

See more


See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top