Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin. Finding common patterns to a set of strings. In Proceedings of the 11th Annual Symposium on Theory of Computing, pages 130–141, 1979.
J. Barzdin. Inductive inference of automata, functions and programs. In Proceedings International Congress of Math., pages 455–460, Vancouver, 1974.
W. Buszkowski and G. Penn. Categorial grammars determined from linguistic data by unification. Studia Logica, 49:431–454, 1990.
W. Buszkowski. Discovery procedures for categorial grammars. In E. Klein and J. van Benthem, editors, Categories, Polymorphism and Unification. University of Amsterdam, 1987.
C. Costa Florêncio. On the complexity of consistent identification of some classes of structure languages. In Arlindo L. Oliveira, editor, Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Artificial Intelligence, pages 89–102. Springer-Verlag, 2000.
R. Daley and C. Smith. On the complexity of inductive inference. Information and Control, 69:12–40, 1986.
E. M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
Sanjay Jain, Daniel Osherson, James Royer, and Arun Sharma. Systems that Learn: An Introduction to Learning Theory. The MIT Press, Cambridge, MA., second edition, 1999.
M. Kanazawa. Learnable Classes of Categorial Grammars. CSLI Publications, Stanford University, 1998.
Steffen Lange and Rolf Wiehagen. Polynomial time inference of arbitrary pattern languages. New Generation Computing, 8:361–370, 1991.
D. N. Osherson, D. de Jongh, E. Martin, and S. Weinstein. Formal learning theory. In J. van Benthem and A. ter Meulen, editors, Handbook of Logic and Language. Elsevier Science Publishing, 1996.
L. Pitt. Inductive inference, dfas, and computational complexity. In K. P. Jantke, editor, Proceedings of International Workshop on Analogical and Inductive Inference, number 397 in Lecture Notes in Computer Science, pages 18–44, 1989.
Werner Stein. Consistent polynominal identification in the limit. In Algorithmic Learning Theory (ALT), volume 1501 of Lecture Notes in Computer Science, pages 424–438, Berlin, 1998. Springer-Verlag.
R. Wiehagen and T. Zeugmann. Learning and consistency. In K. P. Jantke and S. Lange, editors, Algorithmic Learning for Knowledge-Based Systems, number 961 in Lecture Notes in Artificial Intelligence, pages 1–24. Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Florêncio, C.C. (2001). Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-48199-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42273-0
Online ISBN: 978-3-540-48199-7
eBook Packages: Springer Book Archive