Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PFMT_2016_3_a13, author = {U. S. Miniailau}, title = {Detection of elliptical sentences using classification algorithms}, journal = {Problemy fiziki, matematiki i tehniki}, pages = {82--87}, publisher = {mathdoc}, number = {3}, year = {2016}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PFMT_2016_3_a13/} }
U. S. Miniailau. Detection of elliptical sentences using classification algorithms. Problemy fiziki, matematiki i tehniki, no. 3 (2016), pp. 82-87. http://geodesic.mathdoc.fr/item/PFMT_2016_3_a13/
[1] E. V. Grudeva, Izbytochnost teksta, reduktsiya i ellipsis (na materiale russkogo yazyka), Dis. ... d-ra filol. nauk: 10.02.19, SPb., 2009, 448 pp., il.
[2] A. A. Larkina, “Ellipsis i lingvisticheskaya kompressiya v sovremennom frantsuzskom yazyke v teorii yazykovoi ekonomii”, Sovremennaya lingvistika i mezhkulturnaya kommunikatsiya, Monografiya, v 2 kn., v. 1, ed. S. V. Kuprienko, SWorld, Odessa, 2012, 21–33
[3] M. G. Malkovskii, V. S. Minyailov, A. S. Starostin, “Vosstanovlenie ellipsisa kak zadacha avtomaticheskoi obrabotki tekstov”, Programmnye produkty i sistemy, 2014, no. 3(107), 32–36 | DOI
[4] R. McDonald, F. Pereira, K. Ribarov, J. Hajic, “Non-projective Dependency Parsing using Spanning Tree Algorithms”, Human Language Technology and Empirical Methods in Natural Language Processing (HLT/EMNLP) (Vancouver, B.C., Canada, 6–8 October 2005) (Date of access: 16.02.2016) http://citeseer.ist.psu.edu/viewdoc/download?doi=10.1.1.84.2066&rep=rep1&type=pdf
[5] J. Eisner, “Bilexical Grammars and a Cubictime Probabilistic Parser”, Proceedings of the 5th International Workshop on Parsing Technologies (Cambridge, MA, September, 1997), Cambridge, 1997, 54–65 (Date of access: 16.02.2016) ftp://ftp.cis.upenn.edu/pub/jeisner/papers/eisner.iwpt97.pdf
[6] J. Nivre, “An Efficient Algorithm for Projective Dependency Parsing”, Proceedings of the 8th International Workshop on Parsing Technologies, IWPT 03 (Nancy, France, 23–25 April 2003), 149–160
[7] J. Nivre, “Non-Projective Dependency Parsing in Expected Linear Time”, Proceedings of the Joint conference of the 47th Annual Meeting of the Association for Computational Linguistics and the 4th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing (Singapore, 2–7 August 2009), 351–359
[8] A. S. Starostin, M. G. Malkovskii, “Model sintaksisa v sisteme morfosintaksicheskogo analiza “Treeton””, Kompyuternaya lingvistika i intellektualnye tekhnologii, Trudy mezhdunar. konf. «Dialog-2006» (Bekasovo, 31 maya–4 iyunya 2006 g.), Izd-vo RGGU, M., 2006, 481–492
[9] J. Nivre, “Parsing Indian Languages with MaltParser”, Proceedings of the ICON09 NLP Tools Contest: Indian Language Dependency Parsing (Hyderabad, India, 14–17 December 2009), 12–18 (Date of access: 16.02.2016) http://stp.ling.uu.se/ñivre/docs/malt_icon.pdf
[10] B. Bohnet, J. Nivre, “Transition-Based System for Joint Part-of-Speech Tagging and Labeled Non-Projective Dependency Parsing”, Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, EMNLP 2012 (Jeju Island, Korea, 12–14 July 2012), 1455–1465
[11] J. Nivre, I. M. Boguslavsky, L. L. Iomdin, “Parsing the SynTagRus treebank of Russian”, Proceedings of the 22nd International Conference on Computational Linguistics, Coling 2008, 641–648
[12] V. S. Minyailov, “Osobennosti ellipticheskikh konstruktsii v russkom yazyke”, Mir nauki i innovatsii, 3:1(1) (2015), 27–31
[13] Sistema avtomaticheskogo sintaksicheskogo analiza MaltParser, (Data dostupa: 16.02.2016) http://www.maltparser.org/
[14] Natsionalnyi korpus russkogo yazyka, (Data dostupa: 16.02.2016) http://www.ruscorpora.ru/