Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference46 articles.
1. Angluin, D. (1980). Inductive inference of formal languages from positive data. Information and Control, 45, 117–135.
2. Béchet, D. (2003). k-valued link grammars are learnable from strings. In G. Penn (Ed.), Proceedings of the 8th conference on formal grammar (FG-2003 or FGVienna), Vienna, Austria, August 16–17, 2003 (pp. 3–12). CSLI Publications. http://cslipublications.stanford.edu/FG/2003.
3. Béchet, D., Dikovsky, A., & Foret, A. (2005). Dependency structure grammar. In P. Blache, E. Stabler, J. Busquets, R. Moot (Eds.), Logical aspects of computational linguistics, 5th international conference, LACL 2005, Bordeaux, France, April 28–30, 2005. Proceedings, Lecture notes in artificial intelligence (LNAI) (Vol. 3492, pp. 18–34). Springer. https://doi.org/10.1007/b136076.
4. Béchet, D., Dikovsky, A., & Foret, A. (2010). Two models of learning iterated dependencies. In P. de Groote, M. Nederhof (Eds.), Formal grammar, 15th and 16th international conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011, Revised selected papers, Lecture notes in computer science (LNCS) (Vol. 7395, pp. 17–32). Springer. https://doi.org/10.1007/978-3-642-32024-8_2.
5. Béchet, D., Dikovsky, A., & Foret, A. (2011). On dispersed and choice iteration in incrementally learnable dependency types. In: S. Pogodalla, J. Prost (Eds.), Logical aspects of computational linguistics, 6th international conference, LACL 2011, Montpellier, France, June 29–July 1, 2011. Proceedings, Lecture notes in computer science (LNCS) (Vol. 6736, pp. 80–95). Springer. https://doi.org/10.1007/978-3-642-22221-4_6.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Categorial Dependency Grammars: Analysis and Learning;Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021);2023