Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Olgierd Unold Articles by Lukasz Ciel

7th International Conference on Hybrid Intelligent Systems (HIS 2007)

Kaiserslautern, Germany

September 17-September 19

ISBN: 0-7695-2946-1

	ASCII Text	x
	Olgierd Unold, Lukasz Ciel, "Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL," Hybrid Intelligent Systems, International Conference on, pp. 348-352, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007.

	BibTex	x
	@article{ 10.1109/HIS.2007.44, author = {Olgierd Unold and Lukasz Ciel}, title = {Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL}, journal ={Hybrid Intelligent Systems, International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-2946-1}, pages = {348-352}, doi = {http://doi.ieeecomputersociety.org/10.1109/HIS.2007.44}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hybrid Intelligent Systems, International Conference on TI - Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL SN - 0-7695-2946-1 SP348 EP352 A1 - Olgierd Unold, A1 - Lukasz Ciel, PY - 2007 KW - null VL - 0 JA - Hybrid Intelligent Systems, International Conference on ER -

Olgierd Unold, Wroclaw University of Technology, Poland

Lukasz Ciel, Wroclaw University of Technology, Poland

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HIS.2007.44

This paper juxtaposes performance of the grammarbased classifier system (GCS) with tabular representation algorithm (TBL) on the task of inducing context-free grammars from partially structured examples. In both cases structured examples rapidly improve the efficiency of learning algorithms, although there are substantial differences in the way they work. GCS requires more attention while setting initial system parameters and structured examples provide a bit more information than in TBL but on the other hand it is more efficient when tested against the same examples? sets.

Citation:

Olgierd Unold, Lukasz Ciel, "Learning Context-Free Grammars from Partially Structured Examples: Juxtaposition of GCS with TBL," his, pp.348-352, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.