CFG extension for META framework

Author

Tóth, Zsolt ; Kovács, László

Author_Institution

Dept. of Inf. Technol., Univ. of Miskolc, Miskolc, Hungary

fYear

2012

fDate

13-15 June 2012

Firstpage

495

Lastpage

500

Abstract

Grammatical inference (GI) of context free languages (CFG) is an actively researched area of computer science. There are some algorithm, based on different approaches, to induce CFGs and we are going to test and compare the standard CFG generation methods. The goal of the comparison is to develop a more efficient CFG induction method. In order to super the testing and comparison of algorithm, a GI and TM environment, called META, was created [1]. META provides only the basic functions for common grammar processing. In this paper, we present a CFG extension of it, and show some experimental result on CFG induction with META framework.

Keywords

context-free grammars; context-free languages; CFG extension; CFG generation method; CFG induction method; META framework; common grammar processing; computer science; context free language; grammatical inference; Algorithm design and analysis; Approximation algorithms; Context; Genetic algorithms; Grammar; Production; Training; CYK algorithm; Grammar Induction; ITBL algorithm; Inductive CYK algorithm; META framework; TBL algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Engineering Systems (INES), 2012 IEEE 16th International Conference on

Conference_Location

Lisbon

Print_ISBN

978-1-4673-2694-0

Electronic_ISBN

978-1-4673-2693-3

Type

conf

DOI

10.1109/INES.2012.6249884

Filename

6249884