Making answer algorithm for chat-bot

Khrystyna Shakhovska1 kristin.shakhovska [at] gmail.com
  1. ISN Department, Lviv Polytechnic National University, UKRAINE, Lviv, 12 S. Bandery str.
Abstract 

This paper explores pro and cons of existing chatbots and investigate methods of their improvement. Particularly, is proposed usage of Rabin-Karp and Knut-Pratt algorithms for making answer to user and is demonstrated their effectivity

References 

[1] Shevat, Amir (2017). Designing bots: Creating conversational experiences (First ed.). Sebastopol, CA: O'ReillyMedia. ISBN 9781491974827.

[2] Mitsuku // [Internet source]. – Access mode: http://www.mitsuku.com/

[3] Rose // [Internet source]. – Access mode:https://www.robeco.nl/service-contact/index.jsp

[4] Right click// [Internet source]. – Access mode:https://rightclick.io/#/

[5] Poncho // [Internet source]. – Access mode:https://poncho.is/

[6] Insomnobot// [Internet source]. – Access mode:http://insomnobot3000.com/

[7] Dr.A.I// [Internet source]. – Access mode:https://www.healthtap.com/login?redirect_to=/symptoms

[8] Baidu Melody’s // [Internet source]. – Access mode:http://research.baidu.com/baidus-melody-ai-poweredconversational-bot-doc...

[9] Kormen, T., Leyzerson, Ch., Ryvest, R., Shtayn, K. Alhorytm: postroenye y analyz = Introduction to Algorithms / Pod red. Y. V. Krasykova. – 2-e yzd. – M.: Vyl'yams, 2005. – 1296 s. – ISBN 5-8459-0857-4.

[10] Donald Knuth; James H. Morris, Jr, Vaughan Pratt (1977). «Fast pattern matching in strings». SIAM Journal on Computing 6 (2): 323–350. DOI:10.1137/0206024.

[11] Donal'd Knut. Yskusstvo prohrammyrovanyya. Tom 3. Sortyrovka y poysk = The Art of Computer Programming, vol.3. Sorting and Searching. – 2-e yzdanye. – M.: «Vyl'yams», 2007. – S. 824. – ISBN 0-201-89685-0.

[12] Urvacheva, V. A. "Obzor metodov ynformatsyonnoho poyska." Vestnyk Tahanrohskoho ynstytuta ymeny AP Chekhova 1 (2016).

[13] Landauer, Thomas K. Latent semantic analysis. John Wiley & Sons, Ltd, 2006.

[14] Aizawa, Akiko. "An information-theoretic perspective of tf–idf measures." Information Processing & Management 39.1 (2003): 45-65.