Abstract

The present paper deals with the best-case, worst-case and average-case behavior of Lange and Wiehagen's (1991) pattern language learning algorithm with respect to its total learning time. Pattern languages have been introduced by Angluin (1980) and are defined as follows: Let A = f0; 1; : ::g be any non--empty finite alphabet containing at least two elements. Furthermore, let X = fx i i 2 INg be an infinite set of variables such that A " X =;. Patterns are non--empty strings over A [ X. L(), the language generated by pattern is the set of strings which can be obtained by substituting non-null strings from A 3 for the variables of the pattern. Lange and Wiehagen's (1991) algorithm learns the class of all pattern languages in the limit from text. We analyze this algorithm with respect to its total learning time behavior, i.e., the overall time taken by the algorithm until convergence. For every pattern containing k different variables it is shown that the total learning time is O(jj 2 log jAj (jAj + k)) in the best-case and unbounded in the worst-case. Furthermore, we estimate the expectation of the total learning time. In particular, it is shown that Lange and Wiehagen's algorithm possesses an expected total learning time of O(2 k

Citations