Making answer algorithm for chat-bot

Shakhovska, Khrystyna

Please use this identifier to cite or link to this item: https://oldena.lpnu.ua/handle/ntb/40438

Title:	Making answer algorithm for chat-bot
Authors:	Shakhovska, Khrystyna
Affiliation:	Lviv Polytechnic National University
Bibliographic description (Ukraine):	Shakhovska K. Making answer algorithm for chat-bot / Khrystyna Shakhovska // Litteris et Artibus : proceedings, 23–25 November, 2017. — Lviv : Lviv Polytechnic Publishing House, 2017. — P. 394–395. — (9th International academic conference «Computer science & engineering 2017» (CSE-2017)).
Bibliographic description (International):	Shakhovska K. Making answer algorithm for chat-bot / Khrystyna Shakhovska // Litteris et Artibus : proceedings, 23–25 November, 2017. — Lviv : Lviv Polytechnic Publishing House, 2017. — P. 394–395. — (9th International academic conference «Computer science & engineering 2017» (CSE-2017)).
Is part of:	Litteris et Artibus : матеріали, 2017 Litteris et Artibus : proceedings, 2017
Conference/Event:	7th International youth science forum «Litteris et Artibus»
Journal/Collection:	Litteris et Artibus : матеріали
Issue Date:	23-Dec-2017
Publisher:	Видавництво Львівської політехніки Lviv Polytechnic Publishing House
Place of the edition/event:	Львів Lviv
Temporal Coverage:	23–25 листопада 2017 року 23–25 November, 2017
Keywords:	chat-bot hashing prefix-function
Number of pages:	2
Page range:	394-395
Start page:	394
End page:	395
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.
URI:	https://ena.lpnu.ua/handle/ntb/40438
ISBN:	978-966-941-108-2
Copyright owner:	© Національний університет “Львівська політехніка”, 2017
URL for reference material:	http://www.mitsuku.com/ https://www.robeco.nl/service-contact/index.jsp https://rightclick.io/#/ https://poncho.is/ http://insomnobot3000.com/ https://www.healthtap.com/login?redirect_to=/symptoms http://research.baidu.com/baidus-melody-ai-poweredconversational-bot-doctors-patients/
References (Ukraine):	[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-doctors-patients/ [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.
References (International):	[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-doctors-patients/ [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.
Content type:	Conference Abstract
Appears in Collections:	Litteris et Artibus. – 2017 р.

Files in This Item:

File	Description	Size	Format
2017_Shakhovska_K-Making_answer_algorithm_394-395.pdf		157.85 kB	Adobe PDF	View/Open
2017_Shakhovska_K-Making_answer_algorithm_394-395__COVER.png		1.55 MB	image/png	View/Open

Show full item record

putin IS MURDERER