Generating Semantic Frames from Queries Using Natural Language Query Processing In Concertize Search Engine

Authors(7) :-Pranali Khambalkar, Prachi Sawwalakhe, Nandini Kewale, Rutuja Margadhe, Samiksha Sahare, Anshul Rahule, Prof. Umesh S. Samarth

Question and Answering (QA) frameworks are alluded as virtual associates and are imagined to be the cutting edge call focus. However the precision of such QA frameworks isn't as attractive and necessities critical upgrade. Understanding the goal of the inquiry is a critical supporter of an effective framework which has not been frequently broke down. To answer English dialect questions utilizing PC is an intriguing and testing issue. For the most part such issues are dealt with under two classifications: open Domain issues and close space issues. This paper exhibits a framework that endeavours to explain both close and open area issues. Answers to inquiries from close area can't be looked utilizing a web index. Henceforth answers must be put away in a database by an area master. At that point, the test is to comprehend the English dialect question with the goal that the arrangement could be coordinated to the separate answer in the database. We utilize a format coordinating method to play out this coordinating. The framework is produced with the end goal that the inquiries can be asked utilizing short messages from a cell phone and accordingly the framework is intended to comprehend SMS dialect notwithstanding English.

Authors and Affiliations

Pranali Khambalkar
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Prachi Sawwalakhe
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Nandini Kewale
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Rutuja Margadhe
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Samiksha Sahare
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Anshul Rahule
BE Scholars, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India
Prof. Umesh S. Samarth
Assistant Professor, Department Of Computer Science & Engineering, J.D. College of Engineering and Management, Nagpur, Maharashtra, India

Answering System, Template Matching, Natural Language Processing, QA System; NLP Algorithms; Semantic Similarity; User Intent

  1. Dong, X. L., Murphy, K., Gabrilovich, E., Heitz, G., Horn, W., Lao, N. & Zhang, W. (2014). Knowledge Vault: A Web-scale approach to probabilistic knowledge fusion.
  2. Carlos Castillo, Debora Donato et al., “FINDING HIGH QUALITY CONTENTS IN SOCIAL MEDIA”Yahoo! Research Barcelona, Spain, WSDM'08, February 11.12, 2008.
  3. J. P. Scott. Social Network Analysis: A Handbook.SAGE Publications, January 2000.
  4. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604{632, 1999.
  5. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.
  6. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW '04: Proceedings of the 13th international conference on World Wide Web, pages 403{412, New York, NY, USA, 2004. ACM Press
  7. Q. Su, D. Pavlov, J.-H. Chow, and W. C. Baker. Internet-scale collection of human-reviewed data. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 231{240, New York, NY, USA, 2007. ACM Press.
  8. C.-N. Ziegler and G. Lausen. Propagation models for trust and distrust in social networks. Information Systems Frontiers, 7(4-5):337{358, December 2005.
  9. J. Zhang, M. S. Ackerman, and L. Adamic. Expertise networks in online communities: structure and algorithms. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 221{230, New York, NY, USA, 2007. ACM Press.
  10. P. Jurczyk and E. Agichtein. HITS on question answer portals: an exploration of link analysis for author ranking. In SIGIR (posters). ACM, 2007.
  11. B. Dom, I. Eiron, A. Cozzi, and Y. Zhang. Graph-based ranking algorithms for e-mail expertise analysis. In Proceedings of Workshop on Data Mining and Knowledge Discovery, pages 42{48, San Diego, CA, USA, 2003. ACM Press.
  12. T. Joachims, L. A. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting click through data as implicit feedback. In SIGIR, pages 154{161, 2005.
  13. K. Ali and M. Scarr. Robust methodologies for modeling web click distributions. In WWW, pages 511{520, 2007.
  14. C. Anderson. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, July 2006.
  15. Y. Attali and J. Burstein. Automated essay scoring with e-rater v.2. Journal of Technology, Learning, and Assessment, 4(3), February 2006.
  16. A. L. Berger, V. J. D. Pietra, and S. A. D. Pietra. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):39{71, 1996.

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 209-214
Manuscript Number : CSEIT1833257
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Pranali Khambalkar, Prachi Sawwalakhe, Nandini Kewale, Rutuja Margadhe, Samiksha Sahare, Anshul Rahule, Prof. Umesh S. Samarth, "Generating Semantic Frames from Queries Using Natural Language Query Processing In Concertize Search Engine", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.209-214, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT1833257

Article Preview

Follow Us

Contact Us