By Topic

A general approach to inference of context-free programmed grammars

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lu, H.R. ; Univ. of Florida, Gainesville, FL, USA ; Fu, King Sun

A general approach to the inference of context-free programmed grammars (CFPG) is proposed on the basis of inferability analysis. The method is applicable to a sufficiently large class of languages to be used for string pattern description in syntactic pattern recognition. Languages with basic recursive structure whose recursive parameter can be represented by polynomial functions with finite terms are always suitable for the suggested method. Five major problems are discussed: sample set generalization, string segmentation, CFPG trunk grammar inference, CFPG subgrammar inference, and derivation program unification.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-14 ,  Issue: 2 )