PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Learning Balls of Strings: A Horizontal Analysis
Colin de la Higuera, Jean-Christophe Janodet and Frédéric Tantini
(2007) Technical Report. Colin de la Higuera, Jean-Christophe Janodet and Frédéric Tantini, Saint-Étienne, France.

Abstract

There are a number of established paradigms to study the learnability of classes of functions or languages: Query learning, Identification in the limit, Probably Approximately Correct learning. Comparison between these paradigms is hard. Moreover, when to the question of converging one adds computational constraints, the picture becomes even less clear. We concentrate here on just one class of languages, that of topological balls of strings (for the edit distance), and visit the different learning paradigms in this context. Between the results, we show that surprisingly it is technically easier to learn from text than from an informant.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Monograph (Technical Report)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3481
Deposited By:Frédéric Tantini
Deposited On:11 February 2008