As an example, with k = 10 the algorithm will (obviously) fail to merge any states for any word not consisting of at least ten syllables, which will lead to a predictable failure to reconstruct the original finite-state machine in all its parsimony.
we controlled for this problematic but avoidable effect by excluding all generated data points fitting the following criteria: r the learning of the particular language with the provided settings for k and l had not succeeded; and r there were no higher values for k and l for which this case did succeed; and r there was no other case in which the learning did succeed with the provided settings for k and l. we tried to heuristically identify the maximum value, or limit, for k and l that allowed at least one language to be learned.