Abstract
In [Bus87] and [BP90] some ‘discovery procedures’ for classical categorial grammars were defined. These procedures take a set of structures (strings labeled with derivational information) as input and yield a set of hypotheses in the form of grammars.
In [Kan98] learning functions based on these discovery procedures were studied, and it was shown that some of the classes associated with these functions can be identified in the limit (i.e. are learnable) from strings, by a computable function. The time complexity of these functions however was still left an open question.
In this paper we will show that the learning functions for these learnable classes are all NP-hard.
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
Dana Angluin. Finding common patterns to a set of strings. In Proceedings of the 11th Annual Symposium on Theory of Computing, pages 130–141, 1979.
Dana Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117–135, 1980.
Janis Bārzdiņš. Inductive inference of automata, functions and programs. In Proceedings International Congress of Math., pages 455–460, Vancouver, 1974.
Wojciech Buszkowski and Gerald Penn. Categorial grammars determined from linguistic data by unification. Studia Logica, 49:431–454, 1990.
Wojciech Buszkowski. Discovery procedures for categorial grammars. In E. Klein and J. van Benthem, editors, Categories, Polymorphism and Unification. University of Amsterdam, 1987.
Christophe 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.
Christophe Costa Florêncio. Consistent Identification in the Limit of the Class k-valued is NP-hard. In Philippe de Groote, Glyn Morrill, and Christian Retoré, editors, LACL, volume 2099 of Lecture Notes in Computer Science, pages 125–138. Springer, 2001.
Robert P. Daley and Carl H. Smith. On the complexity of inductive inference. Information and Control, 69:12–40, 1986.
Mark Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85:1–11, 1990.
Michael R. Garey and David S. Johnson, editors. Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, New York, 1979.
E. Mark 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.
Makoto Kanazawa. Learnable Classes of Categorial Grammars. CSLI Publications, Stanford University, 1998.
Michael J. Kearns and Umesh V. Vazirani. An Introduction to Computational Learning Theory. Cambridge, Mass.: MIT Press, 1994.
Steffen Lange and Rolf Wiehagen. Polynomial time inference of arbitrary pattern languages. New Generation Computing, 8:361–370, 1991.
Leonard 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.
Richard P. Stanley. Excercises on Catalan and Related Numbers. http://www-math.mit.edu/~rstan/ec/catalan.ps.gz, June 23rd 1998. Excerpted from [Sta99].
Richard P. Stanley. Enumerative Combinatorics, volume 2. Cambridge University Press, 1999.
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.
Rolf Wiehagen and Thomas Zeugmann. Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence, 6:131–144, 1994.
Rolf Wiehagen and Thomas 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.
Thomas Zeugmann and Steffen Lange. A guided tour across the boundaries of learning recursive languages. In K. P. Jantke and S. Lange, editors, Algorithmic Learning for Knowledge-Based Systems-GOSLER Final Report, number 961 in Lecture Notes in Computer Science, pages 190–258. Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Florêncio, C.C. (2002). Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-45790-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44239-4
Online ISBN: 978-3-540-45790-9
eBook Packages: Springer Book Archive