Extensions of a MAT Learner for Regular Tree Languages
2006 (English)In: Proceedings of SAIS 2006: 23rd Annual Workshop of the Swedish Artificial Intelligence Society, Umeå: Swedish Artificial Intelligence Society - SAIS , 2006, 35-44 p.Conference paper (Refereed)
In an earlier paper, we proposed a learning algorithm for regular tree languages in the Minimal Adequate Teacher model and investigated its complexity from a theoretical perspective. Here, we focus on more practical issues. We discuss a concrete implementation made available on the web, which includes two extensions of the basic algorithm. In the paper, the usefulness of these extensions is studied in an experimental setting, by running the variants of the algorithm against target languages with different characteristics.
Place, publisher, year, edition, pages
Umeå: Swedish Artificial Intelligence Society - SAIS , 2006. 35-44 p.
Report / UMINF, ISSN 0348-0542 ; 19
IdentifiersURN: urn:nbn:se:umu:diva-8406OAI: oai:DiVA.org:umu-8406DiVA: diva2:148077