Abstract
In this paper we present two hierarchies of context-free languages: The k,l-NTS languages and the k,l-NTS ≤ languages. k,l-NTS languages generalize the concept of Non-Terminally Separated (NTS) languages by adding a fixed size context to the constituents, in the analog way as k,l-substitutable languages generalize substitutable languages (Yoshinaka, 2008). k,l-NTS ≤ languages are k,l-NTS languages that also consider the edges of sentences as possible contexts. We then prove that Unambiguous k,l-NTS ≤ (k,l-UNTS ≤ ) languages be converted to plain old UNTS languages over a richer alphabet. Using this and the result of polynomial PAC-learnability with positive data of UNTS grammars proved by Clark (2006), we prove that k,l-UNTS ≤ languages are also PAC-learnable under the same conditions.
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
Abney, S., Mcallester, D., Pereira, F.: Relating probabilistic grammars and automata. In: Proceedings of the 37th ACL, pp. 542–549 (1999)
Anthony, M., Biggs, N.: Computational learning theory: an introduction. Cambridge University Press, Cambridge (1992)
Clark, A.: PAC-learning unambiguous NTS languages. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 59–71. Springer, Heidelberg (2006)
Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. J. Mach. Learn. Res. 8, 1725–1745 (2007)
Gold, M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)
Klein, D., Manning, C.D.: Corpus-based induction of syntactic structure: Models of dependency and constituency. In: Proceedings of the 42nd ACL, pp. 478–485 (2004)
Luque, F., Infante-Lopez, G.: Bounding the maximal parsing performance of Non-Terminally Separated grammars. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 135–147. Springer, Heidelberg (2010)
Yoshinaka, R.: Identification in the limit of k,l-substitutable context-free languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 266–279. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luque, F.M., Infante-Lopez, G. (2010). PAC-Learning Unambiguous k,l-NTS ≤ Languages. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-15488-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15487-4
Online ISBN: 978-3-642-15488-1
eBook Packages: Computer ScienceComputer Science (R0)