D. Bechet, k-valued link grammars are learnable from strings, Proccedings of the 8th conference on Formal Grammar (FGVienna), 2003.

J. Besombes and J. Marion, Identification of reversible dependency tree languages, Proceedings of the 3d Workshop on Learning Language in Logic, pp.11-22, 2001.

W. Buszkowski and G. Penn, Categorial grammars determined from linguistic data by unification, Studia Logica, vol.65, issue.4, p.15, 1989.
DOI : 10.1007/BF00370157

A. Dikovsky, Dependencies as categories, Proc. of Workshop " Recent Advances in Dependency Grammars " . In conjunction with COLING, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00456526

A. Foret and Y. L. Nir, Rigid Lambek grammars are not learnable from strings, Proceedings of the 19th international conference on Computational linguistics -, 2002.
DOI : 10.3115/1072228.1072339

A. Foret and Y. L. Nir, On Limit Points for Some Variants of Rigid Lambek Grammars, ICGI'2002, the 6th International Colloquium on Grammatical Inference, no. 2484 in Lecture Notes in Artificial Intelligence, 2002.
DOI : 10.1007/3-540-45790-9_9

H. Gaifman and . Rand-corp, Dependency systems and phrase structure systems Santa Monica (CA) Published in: Information and Control, pp.304-337, 1961.

M. Kanazawa, Learnable classes of categorial grammars. Studies in Logic, Language and Information. FoLLI & CSLI, 1998.

V. Lombardo and L. Lesmo, An Earley-type recognizer for dependency grammar, Proceedings of the 16th conference on Computational linguistics -, pp.723-728, 1996.
DOI : 10.3115/993268.993294

URL : http://acl.ldc.upenn.edu/C/C96/C96-2122.pdf

I. Mel-'cuk, Dependency Syntax: Theory and Practive, 1988.

E. Moreau and . France, Apprentissage des grammaires catgorielles et de dpendances, 2001.

T. Motoki, T. Shinohara, and K. Wright, The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions, The fourth Annual Workshop on Computational Learning Theory, p.375, 1991.
DOI : 10.1016/B978-1-55860-213-7.50037-7

T. Shinohara, INDUCTIVE INFERENCE FROM POSITIVE DATA IS POWERFUL, The 1990 Workshop on Computational Learning Theory, pp.97-110, 1990.
DOI : 10.1016/B978-1-55860-146-8.50010-2

T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Computing, vol.22, issue.4, pp.371-384, 1991.
DOI : 10.1007/BF03037094

D. Sleator and D. Temperley, Parsing English with a link grammar, Third International Workshop on Parsing Technologies, 1993.

K. Wright, IDENTIFICATION OF UNIONS OF LANGUAGES DRAWN FROM AN IDENTIFIABLE CLASS, The 1989 Workshop on Computational Learning Theory, pp.328-333, 1989.
DOI : 10.1016/B978-0-08-094829-4.50026-X