Dice similarity and TF-IDF for new student admissions chatbot

Muhammad, Riko Anshori Prasetya and Arif, Mudi Priyatno (2022) Dice similarity and TF-IDF for new student admissions chatbot. Journal of Artificial Intelligence and Digital Business, 1 (1): 3. pp. 13-18. ISSN 2963-9298

[thumbnail of Jurnal_Muhammad Riko Anshori Prasetya_Universitas Sari Mulia_2022-3.pdf]
Preview
Text
Jurnal_Muhammad Riko Anshori Prasetya_Universitas Sari Mulia_2022-3.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (517kB) | Preview

Abstract

CS is one of the most important functions of any client-related organization, whether a business or a school (customer service).Notably from the committee responsible for student selection, CS, on the other hand, has a very limited capacity to be handled by humans, which can reduce university satisfaction. Therefore, we require technological assistance, which in this case takes the form of an AI-based chatbot. The objective of this study is to design and develop a chatbot system utilizing NLP (natural language processing) to aid the CS of the new student admissions committee at Pahlawan Tuanku Tambusai University in answering questions from prospective new students. The employed method is dice similarity weighted by TFIDF. The results of the conducted tests indicated that the recall rate was 100 percent and the precision reached 76.92 percent. The evaluation results indicate that the chatbot can effectively respond to questions from prospective students.

Item Type: Article
Uncontrolled Keywords: Costumer service, NLP, Chatbot, Dice similarity, TF-IDF
Subjects: Computers, Control & Information Theory
Computers, Control & Information Theory > Applications Software
Depositing User: Djaenudin djae Mohamad
Date Deposited: 13 Mar 2023 07:28
Last Modified: 26 Apr 2023 07:50
URI: https://karya.brin.go.id/id/eprint/14857

Actions (login required)

View Item
View Item