Skip navigation

putin IS MURDERER

Please use this identifier to cite or link to this item: https://oldena.lpnu.ua/handle/ntb/40438
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShakhovska, Khrystyna
dc.coverage.temporal23–25 листопада 2017 року
dc.coverage.temporal23–25 November, 2017
dc.date.accessioned2018-04-12T13:05:49Z-
dc.date.available2018-04-12T13:05:49Z-
dc.date.created2017-12-23
dc.date.issued2017-12-23
dc.identifier.citationShakhovska 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)).
dc.identifier.isbn978-966-941-108-2
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/40438-
dc.description.abstractThis 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.
dc.format.extent394-395
dc.language.isoen
dc.publisherВидавництво Львівської політехніки
dc.publisherLviv Polytechnic Publishing House
dc.relation.ispartofLitteris et Artibus : матеріали, 2017
dc.relation.ispartofLitteris et Artibus : proceedings, 2017
dc.relation.urihttp://www.mitsuku.com/
dc.relation.urihttps://www.robeco.nl/service-contact/index.jsp
dc.relation.urihttps://rightclick.io/#/
dc.relation.urihttps://poncho.is/
dc.relation.urihttp://insomnobot3000.com/
dc.relation.urihttps://www.healthtap.com/login?redirect_to=/symptoms
dc.relation.urihttp://research.baidu.com/baidus-melody-ai-poweredconversational-bot-doctors-patients/
dc.subjectchat-bot
dc.subjecthashing
dc.subjectprefix-function
dc.titleMaking answer algorithm for chat-bot
dc.typeConference Abstract
dc.rights.holder© Національний університет “Львівська політехніка”, 2017
dc.contributor.affiliationLviv Polytechnic National University
dc.format.pages2
dc.identifier.citationenShakhovska 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)).
dc.relation.references[1] Shevat, Amir (2017). Designing bots: Creating conversational experiences (First ed.). Sebastopol, CA: O'ReillyMedia. ISBN 9781491974827.
dc.relation.references[2] Mitsuku // [Internet source]. – Access mode: http://www.mitsuku.com/
dc.relation.references[3] Rose // [Internet source]. – Access mode: https://www.robeco.nl/service-contact/index.jsp
dc.relation.references[4] Right click// [Internet source]. – Access mode: https://rightclick.io/#/
dc.relation.references[5] Poncho // [Internet source]. – Access mode: https://poncho.is/
dc.relation.references[6] Insomnobot// [Internet source]. – Access mode: http://insomnobot3000.com/
dc.relation.references[7] Dr.A.I// [Internet source]. – Access mode: https://www.healthtap.com/login?redirect_to=/symptoms
dc.relation.references[8] Baidu Melody’s // [Internet source]. – Access mode: http://research.baidu.com/baidus-melody-ai-poweredconversational-bot-doctors-patients/
dc.relation.references[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.
dc.relation.references[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.
dc.relation.references[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.
dc.relation.references[12] Urvacheva, V. A. "Obzor metodov ynformatsyonnoho poyska." Vestnyk Tahanrohskoho ynstytuta ymeny AP Chekhova 1 (2016).
dc.relation.references[13] Landauer, Thomas K. Latent semantic analysis. John Wiley & Sons, Ltd, 2006.
dc.relation.references[14] Aizawa, Akiko. "An information-theoretic perspective of tf–idf measures." Information Processing & Management 39.1 (2003): 45-65.
dc.relation.referencesen[1] Shevat, Amir (2017). Designing bots: Creating conversational experiences (First ed.). Sebastopol, CA: O'ReillyMedia. ISBN 9781491974827.
dc.relation.referencesen[2] Mitsuku, [Internet source], Access mode: http://www.mitsuku.com/
dc.relation.referencesen[3] Rose, [Internet source], Access mode: https://www.robeco.nl/service-contact/index.jsp
dc.relation.referencesen[4] Right click// [Internet source], Access mode: https://rightclick.io/#/
dc.relation.referencesen[5] Poncho, [Internet source], Access mode: https://poncho.is/
dc.relation.referencesen[6] Insomnobot// [Internet source], Access mode: http://insomnobot3000.com/
dc.relation.referencesen[7] Dr.A.I// [Internet source], Access mode: https://www.healthtap.com/login?redirect_to=/symptoms
dc.relation.referencesen[8] Baidu Melody’s, [Internet source], Access mode: http://research.baidu.com/baidus-melody-ai-poweredconversational-bot-doctors-patients/
dc.relation.referencesen[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.
dc.relation.referencesen[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.
dc.relation.referencesen[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.
dc.relation.referencesen[12] Urvacheva, V. A. "Obzor metodov ynformatsyonnoho poyska." Vestnyk Tahanrohskoho ynstytuta ymeny AP Chekhova 1 (2016).
dc.relation.referencesen[13] Landauer, Thomas K. Latent semantic analysis. John Wiley & Sons, Ltd, 2006.
dc.relation.referencesen[14] Aizawa, Akiko. "An information-theoretic perspective of tf–idf measures." Information Processing & Management 39.1 (2003): 45-65.
dc.citation.conference7th International youth science forum «Litteris et Artibus»
dc.citation.journalTitleLitteris et Artibus : матеріали
dc.citation.spage394
dc.citation.epage395
dc.coverage.placenameЛьвів
dc.coverage.placenameLviv
Appears in Collections:Litteris et Artibus. – 2017 р.

Files in This Item:
File Description SizeFormat 
2017_Shakhovska_K-Making_answer_algorithm_394-395.pdf157.85 kBAdobe PDFView/Open
2017_Shakhovska_K-Making_answer_algorithm_394-395__COVER.png1.55 MBimage/pngView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.