SOLVING VENN-DIAGRAM BASED COMPREHENSION QUESTIONS IN SET THEORY USING NATURAL LANGUAGE PROCESSING

Published 31 May 2019 •  vol 126  • 


Authors:

 

B Dinesh Reddy, Department of Computer Science and Engineering, Vignan’s Institute of Information Technology, India
A Ravi Kiran, Sr. Member Technical, CDK Global India Pvt. Ltd., India
Abhilash K, Software Engineer, Envestnet Yodlee India
N. Thirupathi Rao,Department of Computer Science and Engineering, Vignan’s Institute of Information Technology, India
Debnath Bhattacharyya,Department of Computer Science and Engineering, Vignan’s Institute of Information Technology, India

Abstract:

 

Natural language problems have gained increased attention in the recent times. There are many special purposes, and carefully constructed evaluations driving the NLP research. Problem solving tests offer an interesting alternative to these evaluations. The primary goal of creating these problem solving tests is to evaluate the reading skills, and there by create bank of training materials and ranking procedures to match the existing measures of human performance. Solving Set Theory problems using NLP exposes once such research problem and helps creating an evaluation method for Natural Language Understanding Systems. This paper describes the possibility to challenge these systems to successively push higher performance levels up to an accuracy of 80% with high speed as an added advantage.

Keywords:

 

NLP, computer, human, set theory, skills, ranking, language, performance, accuracy

References:

 

[1] Manning, Christopher D. and Hinrich Schütze. “Foundations of Statistical Natural Language Processing” Information Retrieval, 4, (2001), pp. 80-81.
[2] Kupiec, Julian, “MURAX: A robust linguistic approach for question answering using an on-line encyclopedia”, In Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, (1993), pp. 181-190.
[3] Weaver, Warren, “Warren Weaver’s memorandum in 1949: Translation. Milestones in Machine Translation”, Locke, WN, Booth, AD (eds.) Ma-chine Translation of Languages: Fourteen Essays, (1955).
[4] Glenn Wadell et. al., “Two applications of Venn Diagrams”, Teaching Statistics, Vol.33, No.2, (2011).
[5] Hirschman, L., Light, M., Breck, E. and Burger, J. D., “June. Deep read: A reading comprehension system”, In Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (1999), pp. 325-332.
[6] Kapashi, Darshan and Pararth Shah, “Answering Reading Comprehension Using Memory Networks”.
[7] Porter, Martin F., “An algorithm for suffix stripping”, Vol.14, No. 3, (1980), pp. 130-137.
[8] Huang, Anna, “Similarity measures for text document clustering”, In Proceedings of the sixth new zealand computer science research student conference (NZCSRSC2008), Christchurch, New Zealand, (2008), pp. 49-56.
[9] The documentation and usage of NLTK is described in www.nltk.org. [Last Accessed on 20-02-2019].
[10] Thada, Vikas, and Vivek Jaglan, “Comparison of jaccard, dice, cosine similarity coefficient to find best fitness value for web retrieved documents using genetic algorithm”, International Journal of Innovations in Engineering and Technology, vol. 2, no. 4, (2013), pp. 202-205.
[11] Bird, Steven and Edward Loper, “NLTK: the natural language toolkit”, In Proceedings of the ACL 2004 on Interactive poster and demonstration sessions, Association for Computational Linguistics, (2004), pp. 31.
[12] https://www.nltk.org/ [Last Accessed on 10-02-2019].
[13] https://stackoverflow.com/questions/945724/cosine-similarity-vs-hamming-distance. [Last Accessed on 10-02-2019].
[14] https://cmry.github.io/notes/euclidean-v-cosine. [Last Accessed on 10-02-2019].
[15] A blog entitled “What is Natural Language Processing in Artificial Intelligence?” by DATAFLAIR Team, November 2018.

Citations:

 

APA:
Reddy, B. D., A. Ravi Kiran, Abhilash K, N. Thirupathi Rao and Debnath Bhattacharyya (2019). Solving Venn-Diagram Based Comprehension Questions in Set Theory Using Natural Language Processing. International Journal of Advanced Science and Technology (IJAST), ISSN: 2005-4238(Print); 2207-6360 (Online), NADIA, 126, 11-20. doi: 10.33832/ijast.2019.126.02.

MLA:
Reddy, B. Dinesh, et al. “Solving Venn-Diagram Based Comprehension Questions in Set Theory Using Natural Language Processing” International Journal of Advanced Science and Technology, ISSN: 2005-4238(Print); 2207-6360 (Online), NADIA, vol. 126, 2019, pp. 11-20. IJAST, http://article.nadiapub.com/IJAST/Vol126/2.html.

IEEE:
[1] B. D. Reddy, A. R. Kiran, Abhilash K, N. Thirupathi Rao and D. Bhattacharyya, “Solving Venn-Diagram Based Comprehension Questions in Set Theory Using Natural Language Processing.” International Journal of Advanced Science and Technology (IJAST), ISSN: 2005-4238(Print); 2207-6360 (Online), NADIA, vol. 126, pp. 11-20, May 2019.