Skip to main content

Enhancement Algorithms for SQL-Based Chatbot

  • Conference paper
Software Engineering and Computer Systems (ICSECS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 180))

Included in the following conference series:

Abstract

Artificial intelligence chatbot is a technology that makes interaction between men and machines using natural language possible. From literature of chatbot’s keywords/pattern matching techniques, some potential issues for enhancement had been discovered. The discovered issues are in the context of relation between previous and next responses/outputs and also keywords arrangement for matching precedence together with keywords variety for matching flexibility. To encounter these issues, two respective algorithms had been proposed. Those algorithms are Extension and Prerequisite and OMAMC (One-match and All-match Categories). Implemented in SQL-Based chatbot, both algorithms are shown to be enhancing the capability of chatbot’s keywords/pattern matching process by providing an augment ways in storing the data and performing the process. This paper will present the significance of results from implementing both proposed algorithms into SQL-Based chatbot that will result on some enhancements in certain area of chatbot’s processes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Christy, A., Thambidurai, P.: CTSS: A Tool for Efficient Information Extraction with Soft Matching Rules for Text Mining. J. Comput. Sci. 4, 375–381 (2008); doi:10.3844/.2008.375.381

    Article  Google Scholar 

  2. Ericsson, K.A., Kintsch, W.: Long-term working memory. Psychol. Rev. 102(2), 211–245 (1995); doi:10.1.1.20.2523

    Google Scholar 

  3. Jia, J.: The study of the application of a web- based chatbot system on the teaching of foreign languages. In: Proceeding of the Society for Information Technology and Teacher Education International Conference (SITE 2004), pp. 1208–1211. AACE Press, USA (2004), http://www.editlib.org/p/13634

    Google Scholar 

  4. Kirschner, P.A., Sweller, J., Clark, R.E.: Why minimal guidance during instruction does not work: An analysis of the failure of constructivist, discovery, problem-based, experiential and inquiry-based teaching. Educational Psychologist 41(2), 75–86 (2006), doi:10.1207/s15326985ep4102_1

    Article  Google Scholar 

  5. Lokman, A.S., Zain, J.M.: Extension and prerequisite: An algorithm to enable relations between responses in chatbot technology. Journal of Computer Science 6(10), 1212–1218 (2010), doi:10.3844/jcssp.2010.1212.1218

    Article  Google Scholar 

  6. Lokman, A.S., Zain, J.M.: One-Match and All-Match Categories for Keywords Matching in Chatbot. American Journal of Applied Science 7(10), 1212–1218 (2010), doi:10.3844/ajassp.2010.1406.1411

    Google Scholar 

  7. Ohno-Machado, L., Weber, G.M.: Data Representation and Algorithms for Biomedical Informatics Applications. Harvard University, Cambridge, MA 184, 11988–11989 (2005) ; ISBN: 0-542- 11988-9

    Google Scholar 

  8. Pickering, M., Clifton, C., Crocker, M.W.: Architectures and Mechanisms in Sentence Comprehension, pp. 1–28. Cambridge University Press, Cambridge (2000); ISBN: 0-521-63121-1

    Google Scholar 

  9. Raju, S.V., Babu, A.V.: Parallel Algorithms for String Matching Problem on Single and Two Dimensional Reconfigurable Pipelined Bus Systems. J. Comput. Sci. 3, 754–759 (2007), doi:10.3844/.2007.754.759

    Article  Google Scholar 

  10. Shah, H.: ALICE: An ACE in digital and. tripleC 4, 284–292 (2006) ;ISSN: 1726-670X

    Google Scholar 

  11. Shawar, B.A., Atwell, E.: A chatbot system as a tool to animate a corpus. ICAME J. 29, 5–24 (2005), http://icame.uib.no/ij29/ij29-page5-24.pdf

    Google Scholar 

  12. Shawar, B.A., Atwell, E.: Chatbots: Are they really useful. LDV-Forum Band 22, 31–50 (2007), doi:10.1.1.106.1099

    Google Scholar 

  13. Turing, A.M.: Computing Machinery and Intelligence. In: Epstein, R., et al. (eds.) Parsing the Turing Tes, pp. 23–65. Springer Science + Business Media BV, Heidelberg (2009); ISBN: 978-1-4020-9624-2

    Chapter  Google Scholar 

  14. Wallace, R.S.: The Anatomy of ALICE. In: Epstein, R., et al. (eds.) Parsing the Turing Test, pp. 181–210. Springer Science + Business Media B.V, Heidelberg (2009); ISBN: 978-1-4020-9624-2

    Chapter  Google Scholar 

  15. Weizenbaum, J.: ELIZA-a computer program for the study of natural language communication between man and machine. Commun. ACM. 9, 36–45 (1966), doi:10.1145/365153.365168

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saliimi Lokman, A., Mohamad Zain, J. (2011). Enhancement Algorithms for SQL-Based Chatbot. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds) Software Engineering and Computer Systems. ICSECS 2011. Communications in Computer and Information Science, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22191-0_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22191-0_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22190-3

  • Online ISBN: 978-3-642-22191-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics