Abstract
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and investigate query learning of CFGs with the help of subpansive trees. We show a restricted class of CFGs, which we call hierarchical CFGs, is efficiently learnable, while it is unlikely to be polynomial-time predictable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angluin, D.: Learning k-bounded context-free grammars, Technical Report YALEU/DCS/RR-557, Yale University (1987)
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
Angluin, D.: Query and concept learning. Machine Learning 2, 319–342 (1988)
Bloomfield, L.: Language. Holt, Rinehart & Winston (1933)
Berman, P., Roods, R.: Learning one-counter languages in polynomial time. In: Proc. 28th IEEE Symposium on Foundation of Computer Science, pp. 61–67 (1987)
Crain, S., Lillo-Martin, D.: Introduction to linguistic theory and natural language acquisition. Blackwell, Malden (1999)
Chomsky, N.: Syntactic structures. Mouton, Netherlands (1957)
Chomsky, N.: Formal properties of grammars, Handbook of mathematical psychology. In: Luce, R.D., Bush, R.R., Galanter, E. (eds.), pp. 323–418. J. Wiley & Sons, Chichester (1963)
Chomsky, N.: Aspects of the theory of syntax. MIT Press, Cambridge (1965)
Chomsky, N.: Remarks on nominalization, Readings in English transformational grammar. In: Jacobs, R.A., Rosenbaum, P.S. (eds.), pp. 184–221. Ginn & Co (1970)
Chomsky, N.: Lectures on government and binding. Foris Publications (1981)
Domingo, C., LavÃn, V.: The query complexity of learning some subclasses of context-free grammars. In: Proc. 2nd European Conference on Machine Learning, pp. 404–414 (1995)
Fukui, N.: Theory of projection in syntax. CSLI Publications, Stanford (1995)
Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Higuera, C.D.L.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley Publishing, Reading (1979)
Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning 5, 151–164 (1990)
Jackendoff, R.: XÌ„ syntax: A study of phrase structure. MIT Press, Cambridge (1977)
Ling, X.: Learning and invention of Horn clause theories - a constructive method. Methodologies for Intelligent Systems 4, 323–331 (1989)
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear threshold algorithm. Machine Learning 2, 285–318 (1988)
Lloyd, J.W.: Foundations of logic programming, 2nd extended edn. Springer, Heidelberg (1987)
Mäkinen, E.: On the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters 42, 1–5 (1992)
Pinker, S.: Language learnability and language development. Harvard University Press, Boston (1984)
Pitt, L., Warmuth, M.K.: Prediction preserving reduction. Journal of Computer System and Science 41, 430–467 (1990)
Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76, 223–242 (1990)
Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Information and Computation 97, 23–60 (1992)
Sakamoto, H.: Language learning from membership queries and characteristic examples. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS (LNAI), vol. 997, pp. 55–65. Springer, Heidelberg (1995)
Sugimoto, N., Hirata, K., Ishizaka, H.: Constructive learning of translations based on dictionaries. In: Arikawa, S., Sharma, A.K. (eds.) ALT 1996. LNCS (LNAI), vol. 1160, pp. 177–184. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sugimoto, N., Toyoshima, T., Shimozono, S., Hirata, K. (2000). Constructive Learning of Context-Free Languages with a Subpansive Tree . In: Oliveira, A.L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2000. Lecture Notes in Computer Science(), vol 1891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45257-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-45257-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41011-9
Online ISBN: 978-3-540-45257-7
eBook Packages: Springer Book Archive