On the complexity of inductive inference
Information and Control
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Learnable classes of categorial grammars
Learnable classes of categorial grammars
On the Complexity of Consistent Identification of Some Classes of Structure Languages
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Consistent Polynominal Identification in the Limit
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On Limit Points for Some Variants of Rigid Lambek Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fast Learning from Strings of 2-Letter Rigid Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Using tree transducers for grammatical inference
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
In [Bus87], [BP90] 'discovery procedures' for CCGs were defined that accept a sequence of structures as input and yield a set of grammars.In [Kan98] it was shown that some of the classes based on these procedures are learnable (in the technical sense of [Gol67]). In [CF00] it was shown that learning some of these classes by means of a consistent learning function is NP-hard.The complexity of learning classes from one particular family, Gk-valued, was still left open. In this paper it is shown that learning any (except one) class from this family by means of a consistent learning function is NP-hard as well.