Abstract
We study learnability of Categorial Dependency Grammars (CDG), a family of categorial grammars expressing all kinds of projective, discontinuous and repeatable dependencies. For these grammars, it is known that they are not learnable from dependency structures.
We propose two different ways of modelling the repeatable dependencies through iterated types and the two corresponding families of CDG which cannot distinguish between the dependencies repeatable at least K times and those repeatable any number of times. For both we show that they are incrementally learnable in the limit from dependency structures.
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.: Two models of learning iterated dependencies. In: Proc. of the 15th Conference on Formal Grammar (FG 2010), Copenhagen, Denmark. LNCS (2010) (to appear), http://www.angl.hu-berlin.de/FG10/fg10_list_of_papers
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 (FG 2004), Nancy, France, pp. 1–16 (2004)
Buszkowski, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Studia Logica 49, 431–454 (1990)
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)
Dekhtyar, M., Dikovsky, A., Karlov, B.: Iterated dependencies and kleene iteration. In: Proc. of the 15th Conference on Formal Grammar (FG 2010), Copenhagen, Denmark. LNCS (2010) (to appear), http://www.angl.hu-berlin.de/FG10/fg10_list_of_papers
Dikovsky, A.: Dependencies as categories. In: Recent Advances in Dependency Grammars, COLING 2004, pp. 90–97 (2004)
Dikovsky, A.: Multimodal categorial dependency grammars. In: Proc. of the 12th Conference on Formal Grammar, Dublin, Ireland, pp. 1–12 (2007)
Dikovsky, A.: Towards wide coverage categorial dependency grammars. In: Proc. of the ESSLLI 2009 Workshop on Parsing with Categorial Grammars. Book of Abstracts, Bordeaux, France (2009)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Kanazawa, M.: Learnable classes of categorial grammars. Studies in Logic, Language and Information, FoLLI & CSLI (1998)
Karlov, B.N.: Normal forms and automata for categorial dependency grammars. Vestnik Tverskogo Gosudarstvennogo Universiteta (Annals of Tver State University). Series: Applied Mathematics 35 (95), 23–43 (2008) (in russ.)
Mel’čuk, I.: Dependency Syntax. SUNY Press, Albany, NY (1988)
Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing 8(4), 371–384 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béchet, D., Dikovsky, A., Foret, A. (2011). On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. In: Pogodalla, S., Prost, JP. (eds) Logical Aspects of Computational Linguistics. LACL 2011. Lecture Notes in Computer Science(), vol 6736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22221-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22221-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22220-7
Online ISBN: 978-3-642-22221-4
eBook Packages: Computer ScienceComputer Science (R0)