DocumentCode :
3247475
Title :
On the Inference of Context-Free Grammars Based On Bottom-Up Parsing and Search
Author :
Prajapati, Gend Lal ; Jain, Aditya ; Khandelwal, Mayank ; Nema, Pooja ; Shukla, Priyanka
Author_Institution :
Dept. of Comput. Eng., Devi Ahilya Univ., Indore, India
fYear :
2009
fDate :
16-18 Dec. 2009
Firstpage :
979
Lastpage :
984
Abstract :
We consider the problem of incremental learning of context-free grammars, using inductive CYK (Cocke-Younger-Kasami) algorithm, based on the non-deterministic learning scheme proposed by Nakamura and Matsumoto in 2005. We implement their learning scheme deterministically and illustrate several examples in order to understand the incremental learning process efficiently. On the basis of this study we also point out some lines of research for possible enhancements.
Keywords :
context-free grammars; learning (artificial intelligence); bottom-up parsing; context free grammars; incremental learning process; inductive Cocke-Younger-Kasami algorithm; nondeterministic learning; Computational complexity; Feeds; Genetics; Inference algorithms; Learning automata; Machine learning; Machine learning algorithms; Polynomials; Production;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Emerging Trends in Engineering and Technology (ICETET), 2009 2nd International Conference on
Conference_Location :
Nagpur
Print_ISBN :
978-1-4244-5250-7
Electronic_ISBN :
978-0-7695-3884-6
Type :
conf
DOI :
10.1109/ICETET.2009.162
Filename :
5395424
Link To Document :
بازگشت