A Survey of Natural Language Query Builder Interface for Structured Databases using Dependency Parsing
|
10.5120/18745-9998 |
Rohini Kokare and Kirti H Wanjale. Article: A Survey of Natural Language Query Builder Interface for Structured Databases using Dependency Parsing. International Journal of Computer Applications 107(5):9-14, December 2014. Full text available. BibTeX
@article{key:article,
author = {Rohini Kokare and Kirti H. Wanjale},
title = {Article: A Survey of Natural Language Query Builder Interface for Structured Databases using Dependency Parsing},
journal = {International Journal of Computer Applications},
year = {2014},
volume = {107},
number = {5},
pages = {9-14},
month = {December},
note = {Full text available}
}
Abstract
Natural language query builder interface retrieves the required data from database when query is given in natural language. To retrieve the correct data from database, the user should have sufficient technical knowledge of Structured Query Language (SQL) statements. Natural Language Query Builder Interface (NLQBI) will solve this problem. In natural language parsing, getting highly accurate syntactic analysis is a crucial step. Parsing of natural languages can be seen as the process of mapping an input string or a sentence to its syntactic representation. One of the parsing technique is dependency parsing. Dependency parsing focuses on relations between words which resolve ambiguity. Most of the recent ef?cient algorithms for dependency parsing work by factoring the dependency trees. Graph based dependency parsing models are prevalent in dependency parsing because of their state-of-art accuracy and efficiency. This paper covers some recent developments in NLQBI systems and survey on dependency parsing techniques.
References
- Mo Shen, Daisuke Kawahara, and Sadao Kurohashi, "Dependency Parse Reranking with Rich Subtree Features" IEEE transactions on audio, speech, and language processing, vol. 22, no. 7, July 2014
- Emily Pitler, "A Crossing-Sensitive Third-Order Factorization for Dependency Parsing", Transactions of the Association of Computational Linguistics -- Volume 2, Issue 1, 2014
- Zhenghua Li, Min Zhang, Wanxiang Che, Ting Liu, and Wenliang Chen, "Joint Optimization for Chinese POS Tagging and Dependency Parsing" IEEE transactions on audio, speech, and language processing, vol. 22, no. 1, Jan 2014
- Preeti Verma, Kulwant Kaur, "Recent Developments in Natural Language Interface to Database Systems", International Journal of Innovation and Research in Computer Science, 2014
- Martins, M. Almeida, and N. A. Smith, "Turning on the turbo: Fast third-order non-projective turbo parsers" In Proceedings of ACL (Short Papers), pages 617–622, 2013
- Bohnet and J. Kuhn, "The best of both worlds – a graph-based completion model for transition-based parsers. " In Proceedings of EACL, pages 77–87. 2012
- Himani Jain, Parteek Bhatia "Hindi Punjabi Language Interface to databases",Journal of Global Research in Computer Science, Volume 2, No. 4, Part 1 (1995), 29–81, April 2011
- T. Koo and M. Collins, "Efficient third-order dependency parsers", in Proc. ACL '10, pp. 1–11, 2010
- C-Phrase System Guide (version 1. 0 beta)Michael Minock Copyright 2010 http://www. cs. umu. se/~mjm/guide. pdf
- Amandeep kaur "Punjabi Language Interface to databases", ME Thesis,Thapar University, june 2010
- Faraj A. El- Mouadib,Zakaria Suliman Zubi,Ahmed A. Almagrous, I. El- Feghi, "Interactive Natural Language Interface (GINLIDB)", ISSN: 1109-2750 664 Issue 4, Volume 8, April 2009
- Yunyao Li, Huahai Yang, and H. V. Jagadish, "NALIX:an Interactive Natural Language Interface for Querying XML", 2006
- Manish R. Joshi, "The ENLIGHT SystemIntelligEnt Natural Language Interface", Department of Computer Science, North Maharashtra University, Jalgaon 2006
- Ryan McDonald, "Discriminative Training and Spanning Tree Algorithms for Dependency Parsing", Ph. D. thesis, University of Pennsylvania, Philadelphia, PA, USA, July 2006
- Ryan McDonald, Fernando Pereira ,"Non-projective Dependency Parsing using Spanning Tree Algorithms" 2005
- J. Nivre and J. Nilsson, "Pseudo-projective dependency parsing", In Proc. ACL, 2005
- Nivre, J. , Hall, J. and Nilsson, J, "Memory-Based Dependency Parsing", In Ng, H. T. and Riloff, E. (eds. ) Proceedings of the Eighth Conference on Computational Natural Language Learning (CoNLL), pp. 49-56, 2004
- J. Nivre, "An efficient algorithm for projective dependency parsing", In Proc. of IWPT-2003, pages 149–160, 2003
- Christer Samuelsson, "A theory of stochastic grammars", In Proceedings of NLP-2000, pages 92{ 105. Springer Verlag, 2000
- Eisner J, "Bilexical grammars and their cubic-time parsing algorithms", In Bunt, H. C. and A. Nijholt, editors, New Developments in Natural Language Parsing, pages 29–62. Kluwer Academic Publishers, 2000
- Jason M. Eisner,"Three New Probabilistic Models for Dependency Parsing: An Exploration", CIS Department, University of Pennsylvania 200 S. 33rd St. , Philadelphia, PA 19104-6389, USA, 1996
- Glenn Carroll and Eugene Charniak, "Two Experiments on learning probabilistic dependency grammers from corpora", Technical Report, TR-92, Department of Computer Science, Brown University, 1992
- J. Edmonds, "Optimum branchings", Journal of research of National Bureau of standards, 71B:233-240, 1967
- Y. J. Chu and T. J. Liu, "On the shortest arborescence of a directed graph Science" Sinica, 14:1396–1400, 1965
- Kubon, V, "A Robust Parser for Czech", Dissertation at MFF UK, Praha, manuscript.