| References: [1] Galitsky, B., Dobrocsi, Gabor., Josep Lluis de la Rosa. (2012). Inferring the semantic properties of sentences by mining syntactic parse trees. Data & Knowledge Engineering, V 81-82, p. 21-45.
[2] Galitsky, B. (2017). Matching parse thickets for open domain question answering. Data & Knowledge Engineering, 107, p. 24-50.
[3] Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12, 23-41.
[4] Plotkin, G. D. (1970). A note on inductive generalization. In: B. Meltzer and D. Michie, editors, Machine Intelligence, 5, 153-163. Elsevier North-Holland, New York.
[5] Khardon, Roni., Arias, Marta. (2006). The subsumption lattice and query learning. Journal of Computer and System Sciences. 72 (1), (February), p 72-94.
[6] Mikolov, Tomas., Chen, Kai., Corrado., G. S., Dean, Jeffrey. (2015). Computing numeric representations of words in a highdimensional space. US Patent 9,037,464, Google, Inc.
[7] Marcu, D. (2000). Rhetorical Parsing of Unrestricted Texts. Computational Linguistics, 2(3).
[8] Ettinger, Allyson., Rao, Sudha.,Hal Daumé III, Emily Bender. (2017). Towards Linguistically Generalizable NLP Systems: A Workshop and Shared Task. 2017. EMNLP, Vancouver, Canada.
[9] Kovalerchuk, B., Kovalerchuk, M. (2017). Toward Virtual Data Scientist with Visual Means. IJCNN.
[10] Makhalova, T., Ilvovsky, D., Galitsky, B. Pattern Structures for News Clustering. FCA4AI@ IJCAI, 35-42
[11] Ganter, B., Kuznetsov, S. O. Pattern Structures and Their Projections. ICCS 2001. 2120, p. 129-142.
[12] Kuznetsov, S. O. (2013). Fitting Pattern Structures to Knowledge Discovery in Big Data. ICFCA 2013. 7880, p. 254–266.
[13] Kuznetsov, S. O. (2013). Scalable Knowledge Discovery in Complex Data with Pattern Structures. PReMI’2013. 8251, p. 30-
41. |
Author Rights 
