Presentation 1995/12/15
A Semi-Automatic Learning Method of Grammar Rules by the Combination of CFG and Bigram
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we describe a semi-automatic learning method of the grammar rules for improving coverage of the sentences. It is possible to analyze the sentences that can not be accepted by preregistered production rules. When a sentence which is not accepted by production rules is inputted to the system, the system learns rules using this input sentence. As a result, the coverage of the sentence can be improved. Except for registering unknown words, there are two methods for learning the grammars. One is to add new production rules to the original CFG. The other is to add word pairs. After learning unknown words and production rules, we evaluate the coverage of sentences and perplexity using above methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) learning of grammar / CFG / word pair / coverage / perplexity
Paper # NLC95-60,SP95-95
Date of Issue

Conference Information
Committee NLC
Conference Date 1995/12/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Vice Chair

Paper Information
Registration To Natural Language Understanding and Models of Communication (NLC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Semi-Automatic Learning Method of Grammar Rules by the Combination of CFG and Bigram
Sub Title (in English)
Keyword(1) learning of grammar
Keyword(2) CFG
Keyword(3) word pair
Keyword(4) coverage
Keyword(5) perplexity
1st Author's Name Kouji OHTANI
1st Author's Affiliation Toyohashi University of Technology()
2nd Author's Name Seiichi NAKAGAWA
2nd Author's Affiliation Toyohashi University of Technology
Date 1995/12/15
Paper # NLC95-60,SP95-95
Volume (vol) vol.95
Number (no) 429
Page pp.pp.-
#Pages 6
Date of Issue