z-logo
open-access-imgOpen Access
Nazief & Adriani Stemming Algorithm With Cosine Similarity Method For Integrated Telegram Chatbots With Service
Author(s) -
I Gusti Lanang Eka Prismana,
Prehanto,
DA Dermawan,
AC Herlingga,
Setya Chendra Wibawa
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1125/1/012039
Subject(s) - chatbot , cosine similarity , ask price , computer science , service (business) , similarity (geometry) , customer service , algorithm , world wide web , information retrieval , artificial intelligence , cluster analysis , economy , economics , image (mathematics)
Information systems have developed a number of questions that are often asked to customers service with a high level of question similarity. For help it create a FAQ related to information systems. The FAQ has a lot of information so that the user is confused and it takes time to find information. More users to ask questions to customer service. Chatbot is one way to help users and customers service in this matter. Customer service can answer questions automatically and users can ask questions as if to ask customer service live. In this study, researchers will apply Nazief & Adriani algorithm used to do stemming because this algorithm is an algorithm which is effective in stemming Indonesian, and method cosine similarity to find the similarity level of questions with FAQs that are in the FAQ database. With implement algorithms and methods in chatbot with the help of the Telegram Messanger service produce a relative answer according to that the user expected. This method is an effective way to answer questions automatically. And if the question asked did not find an answer or the answer is not suitable then the question will be conveyed in e-layanan Information technology development center of Universitas Negeri Surabaya.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here