Abstract
We study the learnability problem in the family of Categorial Dependency Grammars (CDG), a class of categorial grammars defining unlimited dependency structures. CDG satisfying a reasonable condition on iterated (i.e., repeatable and optional) dependencies are shown to be incrementally learnable in the limit.
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
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Béchet, D., Dikovsky, A., Foret, A.: Dependency Structure Grammars. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 18–34. Springer, Heidelberg (2005)
Béchet, D., Dikovsky, A., Foret, A., Moreau, E.: On learning discontinuous dependencies from positive data. In: Proc. of the 9th Intern. Conf. “Formal Grammar 2004” (FG 2004), Nancy, France, pp. 1–16 (August 2004)
Buszkowski, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Studia Logica 49, 431–454 (1990)
Dekhtyar, M., Dikovsky, A.: Categorial dependency grammars. In: Proc. of Intern. Conf. on Categorial Grammars, Montpellier, pp. 76–91 (2004)
Dekhtyar, M., Dikovsky, A.: Generalized Categorial Dependency Grammars. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 230–255. Springer, Heidelberg (2008)
Dikovsky, A.: Dependencies as categories. In: Recent Advances in Dependency Grammars (COLING 2004) Workshop, pp. 90–97 (2004)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Joshi, A.K., Shanker, V.K., Weir, D.J.: The convergence of mildly context-sensitive grammar formalisms. In: Foundational Issues in Natural Language Processing, Cambridge, MA, pp. 31–81 (1991)
Kanazawa, M.: Learnable classes of categorial grammars. Studies in Logic, Language and Information. FoLLI & CSLI (1998)
Mel’čuk, I.: Dependency Syntax. SUNY Press, Albany (1988)
Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity: Corrigendum to identification of unions. In: The fourth Annual Workshop on Computational Learning Theory, San Mateo, Calif, p. 375 (1991)
Shanker, V.K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27, 511–545 (1994)
Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing 8(4), 371–384 (1991)
Wright, K.: Identifications of unions of languages drawn from an identifiable class. In: The 1989 Workshop on Computational Learning Theory, San Mateo, Calif, pp. 328–333 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béchet, D., Dikovsky, A., Foret, A. (2012). Two Models of Learning Iterated Dependencies. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-32024-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32023-1
Online ISBN: 978-3-642-32024-8
eBook Packages: Computer ScienceComputer Science (R0)